./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_spec7_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product25.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6fd6d1c71ba5dc2d3b9a29abb89e94ab4329c839d1f475ee44ea6eb34f32fbde --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:52:53,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:52:53,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:52:53,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:52:53,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:52:53,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:52:53,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:52:53,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:52:53,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:52:53,194 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:52:53,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:52:53,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:52:53,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:52:53,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:52:53,196 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:52:53,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:52:53,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:52:53,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:52:53,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:52:53,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:52:53,198 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:52:53,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:52:53,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:52:53,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:52:53,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:52:53,200 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:52:53,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:52:53,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:52:53,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:52:53,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:52:53,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:52:53,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:52:53,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:52:53,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:52:53,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:52:53,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:52:53,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:52:53,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:52:53,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:52:53,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:52:53,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:52:53,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:52:53,208 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-clean/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-clean/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 -> 6fd6d1c71ba5dc2d3b9a29abb89e94ab4329c839d1f475ee44ea6eb34f32fbde [2024-10-11 02:52:53,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:52:53,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:52:53,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:52:53,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:52:53,527 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:52:53,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product25.cil.c [2024-10-11 02:52:55,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:52:55,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:52:55,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product25.cil.c [2024-10-11 02:52:55,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/769e5a2aa/a5561912895b45f69c79c5a4b2a5f121/FLAGcb689fa1b [2024-10-11 02:52:55,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/769e5a2aa/a5561912895b45f69c79c5a4b2a5f121 [2024-10-11 02:52:55,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:52:55,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:52:55,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:52:55,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:52:55,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:52:55,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:52:55" (1/1) ... [2024-10-11 02:52:55,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@80b141a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:55, skipping insertion in model container [2024-10-11 02:52:55,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:52:55" (1/1) ... [2024-10-11 02:52:55,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:52:56,062 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_spec7_product25.cil.c[8804,8817] [2024-10-11 02:52:56,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:52:56,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:52:56,333 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2024-10-11 02:52:56,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [417] [2024-10-11 02:52:56,335 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [455] [2024-10-11 02:52:56,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [464] [2024-10-11 02:52:56,336 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [481] [2024-10-11 02:52:56,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [710] [2024-10-11 02:52:56,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [728] [2024-10-11 02:52:56,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1800] [2024-10-11 02:52:56,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2088] [2024-10-11 02:52:56,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2454] [2024-10-11 02:52:56,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2857] [2024-10-11 02:52:56,368 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_spec7_product25.cil.c[8804,8817] [2024-10-11 02:52:56,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:52:56,462 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:52:56,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56 WrapperNode [2024-10-11 02:52:56,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:52:56,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:52:56,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:52:56,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:52:56,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,616 INFO L138 Inliner]: procedures = 130, calls = 199, calls flagged for inlining = 61, calls inlined = 58, statements flattened = 1077 [2024-10-11 02:52:56,617 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:52:56,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:52:56,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:52:56,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:52:56,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,684 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-11 02:52:56,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:52:56,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:52:56,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:52:56,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:52:56,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (1/1) ... [2024-10-11 02:52:56,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:52:56,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:52:56,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:52:56,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:52:56,857 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-11 02:52:56,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-11 02:52:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-11 02:52:56,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-11 02:52:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2024-10-11 02:52:56,858 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2024-10-11 02:52:56,858 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:52:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:52:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:52:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:52:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:52:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:52:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:52:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:52:56,860 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:52:56,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:52:56,861 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:52:56,861 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:52:56,862 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:52:56,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:52:56,862 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:52:56,863 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:52:56,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:52:56,863 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:52:56,863 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:52:56,863 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-11 02:52:56,864 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-11 02:52:56,864 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:52:56,864 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:52:56,864 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:52:56,864 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:52:56,864 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:52:56,864 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:52:56,864 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:52:56,865 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:52:56,865 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:52:56,865 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:52:56,865 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:52:56,865 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:52:56,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:52:56,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:52:56,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:52:56,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:52:56,866 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:52:56,866 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:52:56,866 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-11 02:52:56,866 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-11 02:52:56,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:52:56,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:52:57,070 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:52:57,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:52:58,127 INFO L? ?]: Removed 540 outVars from TransFormulas that were not future-live. [2024-10-11 02:52:58,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:52:58,197 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:52:58,198 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:52:58,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:52:58 BoogieIcfgContainer [2024-10-11 02:52:58,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:52:58,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:52:58,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:52:58,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:52:58,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:52:55" (1/3) ... [2024-10-11 02:52:58,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac54562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:52:58, skipping insertion in model container [2024-10-11 02:52:58,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:56" (2/3) ... [2024-10-11 02:52:58,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac54562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:52:58, skipping insertion in model container [2024-10-11 02:52:58,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:52:58" (3/3) ... [2024-10-11 02:52:58,207 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product25.cil.c [2024-10-11 02:52:58,224 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:52:58,224 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:52:58,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:52:58,313 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;@700bf361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:52:58,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:52:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 273 states have (on average 1.63003663003663) internal successors, (445), 276 states have internal predecessors, (445), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 02:52:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 02:52:58,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:58,346 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:52:58,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:58,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 232270281, now seen corresponding path program 1 times [2024-10-11 02:52:58,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772894535] [2024-10-11 02:52:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:52:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:52:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:52:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:52:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:52:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:52:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:52:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:52:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:52:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:52:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772894535] [2024-10-11 02:52:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772894535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:52:59,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800254823] [2024-10-11 02:52:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:59,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:59,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:52:59,248 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:52:59,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:52:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:59,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:52:59,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:52:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:52:59,608 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:52:59,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800254823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:59,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:52:59,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:52:59,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437674516] [2024-10-11 02:52:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:59,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:52:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:59,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:52:59,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:52:59,648 INFO L87 Difference]: Start difference. First operand has 350 states, 273 states have (on average 1.63003663003663) internal successors, (445), 276 states have internal predecessors, (445), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:52:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:59,777 INFO L93 Difference]: Finished difference Result 516 states and 805 transitions. [2024-10-11 02:52:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:52:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2024-10-11 02:52:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:59,793 INFO L225 Difference]: With dead ends: 516 [2024-10-11 02:52:59,793 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 02:52:59,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 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-11 02:52:59,806 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:59,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:52:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 02:52:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-11 02:52:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 271 states have (on average 1.6162361623616237) internal successors, (438), 273 states have internal predecessors, (438), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 02:52:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 545 transitions. [2024-10-11 02:52:59,896 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 545 transitions. Word has length 88 [2024-10-11 02:52:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:59,899 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 545 transitions. [2024-10-11 02:52:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:52:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 545 transitions. [2024-10-11 02:52:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:52:59,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:59,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:52:59,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:53:00,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:53:00,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:00,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1087561943, now seen corresponding path program 1 times [2024-10-11 02:53:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:00,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480179379] [2024-10-11 02:53:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:53:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:53:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:53:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:53:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:53:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:53:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:53:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:53:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:53:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:53:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480179379] [2024-10-11 02:53:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480179379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422359339] [2024-10-11 02:53:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:00,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:00,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:53:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:00,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:53:00,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:53:00,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:00,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422359339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:00,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:00,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:53:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518657895] [2024-10-11 02:53:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:00,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:53:00,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:00,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:53:00,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:00,901 INFO L87 Difference]: Start difference. First operand 347 states and 545 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:00,978 INFO L93 Difference]: Finished difference Result 512 states and 789 transitions. [2024-10-11 02:53:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:53:00,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-10-11 02:53:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:00,983 INFO L225 Difference]: With dead ends: 512 [2024-10-11 02:53:00,987 INFO L226 Difference]: Without dead ends: 349 [2024-10-11 02:53:00,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:00,993 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:00,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1057 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:53:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-11 02:53:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-10-11 02:53:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 273 states have (on average 1.6117216117216118) internal successors, (440), 275 states have internal predecessors, (440), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 02:53:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 547 transitions. [2024-10-11 02:53:01,015 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 547 transitions. Word has length 89 [2024-10-11 02:53:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:01,016 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 547 transitions. [2024-10-11 02:53:01,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 547 transitions. [2024-10-11 02:53:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:53:01,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:01,019 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:01,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:53:01,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:01,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:01,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash -783048735, now seen corresponding path program 1 times [2024-10-11 02:53:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470026596] [2024-10-11 02:53:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:53:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:53:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:53:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:53:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:53:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:53:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:53:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:53:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:53:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:53:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470026596] [2024-10-11 02:53:01,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470026596] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531469865] [2024-10-11 02:53:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:01,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:01,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:01,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:01,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:53:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:01,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:53:01,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:53:01,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:01,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531469865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:01,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:01,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:53:01,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040617957] [2024-10-11 02:53:01,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:01,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:53:01,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:01,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:53:01,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:01,838 INFO L87 Difference]: Start difference. First operand 349 states and 547 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:01,904 INFO L93 Difference]: Finished difference Result 746 states and 1186 transitions. [2024-10-11 02:53:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:53:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2024-10-11 02:53:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:01,911 INFO L225 Difference]: With dead ends: 746 [2024-10-11 02:53:01,911 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 02:53:01,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:01,915 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 129 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:01,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1026 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:53:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 02:53:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 414. [2024-10-11 02:53:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 324 states have (on average 1.626543209876543) internal successors, (527), 326 states have internal predecessors, (527), 68 states have call successors, (68), 21 states have call predecessors, (68), 21 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-11 02:53:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 662 transitions. [2024-10-11 02:53:01,952 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 662 transitions. Word has length 94 [2024-10-11 02:53:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:01,954 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 662 transitions. [2024-10-11 02:53:01,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 662 transitions. [2024-10-11 02:53:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:53:01,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:01,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:01,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:53:02,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:02,163 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:02,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1734652277, now seen corresponding path program 1 times [2024-10-11 02:53:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466226449] [2024-10-11 02:53:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:53:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:53:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:53:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:53:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:53:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:53:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:53:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:53:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:53:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:53:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466226449] [2024-10-11 02:53:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466226449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821800736] [2024-10-11 02:53:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:02,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:02,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:02,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:02,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:53:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:02,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:53:02,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:53:02,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821800736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:02,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:02,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:53:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021654785] [2024-10-11 02:53:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:02,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:53:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:02,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:53:02,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:53:02,800 INFO L87 Difference]: Start difference. First operand 414 states and 662 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:53:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:02,920 INFO L93 Difference]: Finished difference Result 823 states and 1318 transitions. [2024-10-11 02:53:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:53:02,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 95 [2024-10-11 02:53:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:02,925 INFO L225 Difference]: With dead ends: 823 [2024-10-11 02:53:02,925 INFO L226 Difference]: Without dead ends: 416 [2024-10-11 02:53:02,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 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-11 02:53:02,927 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 2 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:02,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2073 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:53:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-11 02:53:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-10-11 02:53:02,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 325 states have (on average 1.6246153846153846) internal successors, (528), 328 states have internal predecessors, (528), 68 states have call successors, (68), 21 states have call predecessors, (68), 22 states have return successors, (69), 66 states have call predecessors, (69), 67 states have call successors, (69) [2024-10-11 02:53:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 665 transitions. [2024-10-11 02:53:02,948 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 665 transitions. Word has length 95 [2024-10-11 02:53:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:02,948 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 665 transitions. [2024-10-11 02:53:02,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:53:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 665 transitions. [2024-10-11 02:53:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:53:02,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:02,951 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:02,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:53:03,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:03,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:03,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash 185290839, now seen corresponding path program 1 times [2024-10-11 02:53:03,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:03,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953108627] [2024-10-11 02:53:03,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:03,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:53:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:53:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:53:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:53:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:53:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:53:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:53:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:53:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:53:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:03,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953108627] [2024-10-11 02:53:03,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953108627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:03,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223007886] [2024-10-11 02:53:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:03,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:03,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:03,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:53:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:03,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:53:03,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:53:03,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223007886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:03,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:53:03,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815599560] [2024-10-11 02:53:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:03,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:53:03,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:53:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:53:03,742 INFO L87 Difference]: Start difference. First operand 416 states and 665 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:53:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:03,847 INFO L93 Difference]: Finished difference Result 825 states and 1323 transitions. [2024-10-11 02:53:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:53:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2024-10-11 02:53:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:03,851 INFO L225 Difference]: With dead ends: 825 [2024-10-11 02:53:03,851 INFO L226 Difference]: Without dead ends: 418 [2024-10-11 02:53:03,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 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-11 02:53:03,853 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 2 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:03,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2059 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:53:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-11 02:53:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2024-10-11 02:53:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 326 states have (on average 1.6226993865030674) internal successors, (529), 330 states have internal predecessors, (529), 68 states have call successors, (68), 21 states have call predecessors, (68), 23 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2024-10-11 02:53:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 671 transitions. [2024-10-11 02:53:03,870 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 671 transitions. Word has length 96 [2024-10-11 02:53:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:03,871 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 671 transitions. [2024-10-11 02:53:03,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:53:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 671 transitions. [2024-10-11 02:53:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:53:03,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:03,873 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:03,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:53:04,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:04,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:04,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:04,074 INFO L85 PathProgramCache]: Analyzing trace with hash -262517584, now seen corresponding path program 1 times [2024-10-11 02:53:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:04,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786641004] [2024-10-11 02:53:04,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:53:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:53:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:53:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:53:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:53:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:53:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:53:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:53:04,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:04,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786641004] [2024-10-11 02:53:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786641004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:04,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:04,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:53:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436716650] [2024-10-11 02:53:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:04,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:53:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:04,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:53:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:53:04,287 INFO L87 Difference]: Start difference. First operand 418 states and 671 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:53:06,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:06,654 INFO L93 Difference]: Finished difference Result 960 states and 1572 transitions. [2024-10-11 02:53:06,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:53:06,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-10-11 02:53:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:06,660 INFO L225 Difference]: With dead ends: 960 [2024-10-11 02:53:06,660 INFO L226 Difference]: Without dead ends: 561 [2024-10-11 02:53:06,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 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-11 02:53:06,663 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1192 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:06,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 1199 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2740 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:53:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-10-11 02:53:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 418. [2024-10-11 02:53:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 326 states have (on average 1.6226993865030674) internal successors, (529), 330 states have internal predecessors, (529), 68 states have call successors, (68), 21 states have call predecessors, (68), 23 states have return successors, (73), 66 states have call predecessors, (73), 67 states have call successors, (73) [2024-10-11 02:53:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 670 transitions. [2024-10-11 02:53:06,742 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 670 transitions. Word has length 97 [2024-10-11 02:53:06,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:06,742 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 670 transitions. [2024-10-11 02:53:06,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:53:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 670 transitions. [2024-10-11 02:53:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:53:06,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:06,745 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] [2024-10-11 02:53:06,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:53:06,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:06,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:06,746 INFO L85 PathProgramCache]: Analyzing trace with hash -843276902, now seen corresponding path program 2 times [2024-10-11 02:53:06,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:06,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110686111] [2024-10-11 02:53:06,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:06,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:53:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:53:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:53:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:53:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:53:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:53:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:53:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:53:06,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:06,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110686111] [2024-10-11 02:53:06,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110686111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:06,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:06,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:53:06,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051794929] [2024-10-11 02:53:06,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:06,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:53:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:06,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:53:06,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:53:06,965 INFO L87 Difference]: Start difference. First operand 418 states and 670 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:53:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:09,200 INFO L93 Difference]: Finished difference Result 962 states and 1575 transitions. [2024-10-11 02:53:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:53:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2024-10-11 02:53:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:09,205 INFO L225 Difference]: With dead ends: 962 [2024-10-11 02:53:09,206 INFO L226 Difference]: Without dead ends: 563 [2024-10-11 02:53:09,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:53:09,210 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1189 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:09,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 1198 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 02:53:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-10-11 02:53:09,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 420. [2024-10-11 02:53:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 327 states have (on average 1.620795107033639) internal successors, (530), 332 states have internal predecessors, (530), 68 states have call successors, (68), 21 states have call predecessors, (68), 24 states have return successors, (75), 66 states have call predecessors, (75), 67 states have call successors, (75) [2024-10-11 02:53:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 673 transitions. [2024-10-11 02:53:09,248 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 673 transitions. Word has length 98 [2024-10-11 02:53:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:09,249 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 673 transitions. [2024-10-11 02:53:09,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:53:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 673 transitions. [2024-10-11 02:53:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:53:09,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:09,251 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:09,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:53:09,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:09,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -412363595, now seen corresponding path program 1 times [2024-10-11 02:53:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766111060] [2024-10-11 02:53:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:53:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:53:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:53:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:53:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:53:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:53:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:53:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766111060] [2024-10-11 02:53:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766111060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:09,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:09,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:53:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914595472] [2024-10-11 02:53:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:09,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:53:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:53:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:53:09,525 INFO L87 Difference]: Start difference. First operand 420 states and 673 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:53:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:12,431 INFO L93 Difference]: Finished difference Result 960 states and 1570 transitions. [2024-10-11 02:53:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:53:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 99 [2024-10-11 02:53:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:12,435 INFO L225 Difference]: With dead ends: 960 [2024-10-11 02:53:12,435 INFO L226 Difference]: Without dead ends: 563 [2024-10-11 02:53:12,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:53:12,437 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1195 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4491 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 4491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:12,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 1662 Invalid, 4872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 4491 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 02:53:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-10-11 02:53:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 420. [2024-10-11 02:53:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 327 states have (on average 1.620795107033639) internal successors, (530), 332 states have internal predecessors, (530), 68 states have call successors, (68), 21 states have call predecessors, (68), 24 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2024-10-11 02:53:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 672 transitions. [2024-10-11 02:53:12,471 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 672 transitions. Word has length 99 [2024-10-11 02:53:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:12,471 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 672 transitions. [2024-10-11 02:53:12,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:53:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 672 transitions. [2024-10-11 02:53:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:53:12,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:12,474 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] [2024-10-11 02:53:12,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:53:12,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:12,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:12,477 INFO L85 PathProgramCache]: Analyzing trace with hash 59105814, now seen corresponding path program 2 times [2024-10-11 02:53:12,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:12,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916816201] [2024-10-11 02:53:12,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:53:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:53:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:53:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:53:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:53:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:53:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:53:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916816201] [2024-10-11 02:53:12,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916816201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:12,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:12,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:53:12,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562896937] [2024-10-11 02:53:12,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:12,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:53:12,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:12,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:53:12,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:53:12,723 INFO L87 Difference]: Start difference. First operand 420 states and 672 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:53:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:15,153 INFO L93 Difference]: Finished difference Result 962 states and 1576 transitions. [2024-10-11 02:53:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:53:15,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 100 [2024-10-11 02:53:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:15,158 INFO L225 Difference]: With dead ends: 962 [2024-10-11 02:53:15,159 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 02:53:15,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:53:15,161 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1191 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4550 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 4550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:15,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1663 Invalid, 4927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 4550 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:53:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 02:53:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 422. [2024-10-11 02:53:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 328 states have (on average 1.6189024390243902) internal successors, (531), 334 states have internal predecessors, (531), 68 states have call successors, (68), 21 states have call predecessors, (68), 25 states have return successors, (79), 66 states have call predecessors, (79), 67 states have call successors, (79) [2024-10-11 02:53:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 678 transitions. [2024-10-11 02:53:15,225 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 678 transitions. Word has length 100 [2024-10-11 02:53:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:15,225 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 678 transitions. [2024-10-11 02:53:15,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:53:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 678 transitions. [2024-10-11 02:53:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:53:15,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:15,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:15,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:53:15,230 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:15,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash 251241306, now seen corresponding path program 1 times [2024-10-11 02:53:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:15,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955899687] [2024-10-11 02:53:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:15,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:53:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:53:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:53:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:53:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:53:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:53:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955899687] [2024-10-11 02:53:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955899687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:15,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757814053] [2024-10-11 02:53:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:15,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:15,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:15,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:53:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:53:15,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:15,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:53:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757814053] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:53:15,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:53:15,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-11 02:53:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925681802] [2024-10-11 02:53:15,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:53:15,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:53:15,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:15,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:53:15,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:53:15,773 INFO L87 Difference]: Start difference. First operand 422 states and 678 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 7 states have internal predecessors, (90), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:53:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:18,058 INFO L93 Difference]: Finished difference Result 1148 states and 1953 transitions. [2024-10-11 02:53:18,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:53:18,058 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 7 states have internal predecessors, (90), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 101 [2024-10-11 02:53:18,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:18,065 INFO L225 Difference]: With dead ends: 1148 [2024-10-11 02:53:18,065 INFO L226 Difference]: Without dead ends: 985 [2024-10-11 02:53:18,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 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-11 02:53:18,067 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 1570 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 4089 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 4089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:18,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1781 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 4089 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 02:53:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-10-11 02:53:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 827. [2024-10-11 02:53:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 654 states have (on average 1.6681957186544343) internal successors, (1091), 660 states have internal predecessors, (1091), 147 states have call successors, (147), 21 states have call predecessors, (147), 25 states have return successors, (168), 145 states have call predecessors, (168), 146 states have call successors, (168) [2024-10-11 02:53:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1406 transitions. [2024-10-11 02:53:18,121 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1406 transitions. Word has length 101 [2024-10-11 02:53:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:18,121 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1406 transitions. [2024-10-11 02:53:18,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 7 states have internal predecessors, (90), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:53:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1406 transitions. [2024-10-11 02:53:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:53:18,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:18,126 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:18,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 02:53:18,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:53:18,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:18,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1566909609, now seen corresponding path program 1 times [2024-10-11 02:53:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:18,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433461644] [2024-10-11 02:53:18,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:18,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:53:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:53:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:53:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:53:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:53:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:53:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:18,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433461644] [2024-10-11 02:53:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433461644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:18,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:18,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838418191] [2024-10-11 02:53:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:18,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:18,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:18,480 INFO L87 Difference]: Start difference. First operand 827 states and 1406 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:20,056 INFO L93 Difference]: Finished difference Result 2144 states and 3732 transitions. [2024-10-11 02:53:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-10-11 02:53:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:20,067 INFO L225 Difference]: With dead ends: 2144 [2024-10-11 02:53:20,067 INFO L226 Difference]: Without dead ends: 1377 [2024-10-11 02:53:20,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:20,072 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1313 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:20,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 907 Invalid, 2017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:53:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2024-10-11 02:53:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1229. [2024-10-11 02:53:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 977 states have (on average 1.676560900716479) internal successors, (1638), 983 states have internal predecessors, (1638), 226 states have call successors, (226), 21 states have call predecessors, (226), 25 states have return successors, (257), 224 states have call predecessors, (257), 225 states have call successors, (257) [2024-10-11 02:53:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2121 transitions. [2024-10-11 02:53:20,165 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 2121 transitions. Word has length 107 [2024-10-11 02:53:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:20,165 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 2121 transitions. [2024-10-11 02:53:20,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2121 transitions. [2024-10-11 02:53:20,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:53:20,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:20,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:20,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:53:20,172 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:20,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash -306253710, now seen corresponding path program 1 times [2024-10-11 02:53:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221881630] [2024-10-11 02:53:20,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:20,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:53:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:53:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:53:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:53:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:53:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:53:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221881630] [2024-10-11 02:53:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221881630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:20,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208733198] [2024-10-11 02:53:20,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:20,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:20,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:20,286 INFO L87 Difference]: Start difference. First operand 1229 states and 2121 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:21,919 INFO L93 Difference]: Finished difference Result 3127 states and 5479 transitions. [2024-10-11 02:53:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-11 02:53:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:21,934 INFO L225 Difference]: With dead ends: 3127 [2024-10-11 02:53:21,934 INFO L226 Difference]: Without dead ends: 2008 [2024-10-11 02:53:21,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:21,941 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1311 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:21,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 893 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:53:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2024-10-11 02:53:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1860. [2024-10-11 02:53:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1489 states have (on average 1.6816655473472129) internal successors, (2504), 1495 states have internal predecessors, (2504), 345 states have call successors, (345), 21 states have call predecessors, (345), 25 states have return successors, (376), 343 states have call predecessors, (376), 344 states have call successors, (376) [2024-10-11 02:53:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 3225 transitions. [2024-10-11 02:53:22,059 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 3225 transitions. Word has length 108 [2024-10-11 02:53:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:22,059 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 3225 transitions. [2024-10-11 02:53:22,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3225 transitions. [2024-10-11 02:53:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 02:53:22,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:22,069 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:22,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:53:22,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:22,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 91041177, now seen corresponding path program 1 times [2024-10-11 02:53:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897710162] [2024-10-11 02:53:22,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:22,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:53:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:53:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:53:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:53:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:53:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:53:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:22,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897710162] [2024-10-11 02:53:22,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897710162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:22,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:22,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478899957] [2024-10-11 02:53:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:22,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:22,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:22,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:22,195 INFO L87 Difference]: Start difference. First operand 1860 states and 3225 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:23,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:23,784 INFO L93 Difference]: Finished difference Result 4607 states and 8131 transitions. [2024-10-11 02:53:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:23,785 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-10-11 02:53:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:23,803 INFO L225 Difference]: With dead ends: 4607 [2024-10-11 02:53:23,804 INFO L226 Difference]: Without dead ends: 2977 [2024-10-11 02:53:23,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:23,811 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1311 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:23,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 878 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:53:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2024-10-11 02:53:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2829. [2024-10-11 02:53:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2296 states have (on average 1.6864111498257839) internal successors, (3872), 2302 states have internal predecessors, (3872), 507 states have call successors, (507), 21 states have call predecessors, (507), 25 states have return successors, (554), 505 states have call predecessors, (554), 506 states have call successors, (554) [2024-10-11 02:53:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4933 transitions. [2024-10-11 02:53:23,936 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4933 transitions. Word has length 109 [2024-10-11 02:53:23,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:23,937 INFO L471 AbstractCegarLoop]: Abstraction has 2829 states and 4933 transitions. [2024-10-11 02:53:23,937 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:23,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4933 transitions. [2024-10-11 02:53:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:53:23,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:23,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:23,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:53:23,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:23,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash 85321843, now seen corresponding path program 1 times [2024-10-11 02:53:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:23,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504734872] [2024-10-11 02:53:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:53:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:53:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:53:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:53:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:53:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:53:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504734872] [2024-10-11 02:53:24,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504734872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:24,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:24,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561716236] [2024-10-11 02:53:24,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:24,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:24,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:24,064 INFO L87 Difference]: Start difference. First operand 2829 states and 4933 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:25,512 INFO L93 Difference]: Finished difference Result 6947 states and 12336 transitions. [2024-10-11 02:53:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:25,512 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-11 02:53:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:25,542 INFO L225 Difference]: With dead ends: 6947 [2024-10-11 02:53:25,543 INFO L226 Difference]: Without dead ends: 4545 [2024-10-11 02:53:25,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:25,555 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1308 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:25,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 879 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:53:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2024-10-11 02:53:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4397. [2024-10-11 02:53:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 3619 states have (on average 1.6899696048632218) internal successors, (6116), 3625 states have internal predecessors, (6116), 752 states have call successors, (752), 21 states have call predecessors, (752), 25 states have return successors, (825), 750 states have call predecessors, (825), 751 states have call successors, (825) [2024-10-11 02:53:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7693 transitions. [2024-10-11 02:53:25,820 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7693 transitions. Word has length 110 [2024-10-11 02:53:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:25,821 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7693 transitions. [2024-10-11 02:53:25,821 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7693 transitions. [2024-10-11 02:53:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:53:25,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:25,836 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:25,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:53:25,836 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:25,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1293610251, now seen corresponding path program 1 times [2024-10-11 02:53:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:25,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009495439] [2024-10-11 02:53:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:53:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:53:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:53:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:53:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:53:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:53:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:25,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:25,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009495439] [2024-10-11 02:53:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009495439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710973551] [2024-10-11 02:53:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:25,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:25,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:25,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:25,958 INFO L87 Difference]: Start difference. First operand 4397 states and 7693 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:27,614 INFO L93 Difference]: Finished difference Result 10900 states and 19403 transitions. [2024-10-11 02:53:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:27,615 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-10-11 02:53:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:27,668 INFO L225 Difference]: With dead ends: 10900 [2024-10-11 02:53:27,668 INFO L226 Difference]: Without dead ends: 7217 [2024-10-11 02:53:27,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:27,687 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1309 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:27,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 906 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:53:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7217 states. [2024-10-11 02:53:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7217 to 7069. [2024-10-11 02:53:28,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7069 states, 5798 states have (on average 1.6833390824422214) internal successors, (9760), 5804 states have internal predecessors, (9760), 1245 states have call successors, (1245), 21 states have call predecessors, (1245), 25 states have return successors, (1362), 1243 states have call predecessors, (1362), 1244 states have call successors, (1362) [2024-10-11 02:53:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7069 states to 7069 states and 12367 transitions. [2024-10-11 02:53:28,068 INFO L78 Accepts]: Start accepts. Automaton has 7069 states and 12367 transitions. Word has length 111 [2024-10-11 02:53:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:28,069 INFO L471 AbstractCegarLoop]: Abstraction has 7069 states and 12367 transitions. [2024-10-11 02:53:28,069 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7069 states and 12367 transitions. [2024-10-11 02:53:28,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:53:28,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:28,088 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:28,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:53:28,088 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:28,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:28,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1502804759, now seen corresponding path program 1 times [2024-10-11 02:53:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:28,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341905668] [2024-10-11 02:53:28,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:53:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:53:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:53:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:53:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:53:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:53:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:28,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341905668] [2024-10-11 02:53:28,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341905668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:28,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:28,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:28,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254753326] [2024-10-11 02:53:28,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:28,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:28,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:28,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:28,215 INFO L87 Difference]: Start difference. First operand 7069 states and 12367 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:29,923 INFO L93 Difference]: Finished difference Result 18035 states and 32087 transitions. [2024-10-11 02:53:29,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:29,924 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-10-11 02:53:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:29,981 INFO L225 Difference]: With dead ends: 18035 [2024-10-11 02:53:29,981 INFO L226 Difference]: Without dead ends: 12046 [2024-10-11 02:53:30,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:30,009 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1305 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:30,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 891 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:53:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12046 states. [2024-10-11 02:53:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12046 to 11898. [2024-10-11 02:53:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11898 states, 9805 states have (on average 1.6828148903620601) internal successors, (16500), 9811 states have internal predecessors, (16500), 2067 states have call successors, (2067), 21 states have call predecessors, (2067), 25 states have return successors, (2262), 2065 states have call predecessors, (2262), 2066 states have call successors, (2262) [2024-10-11 02:53:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11898 states to 11898 states and 20829 transitions. [2024-10-11 02:53:30,558 INFO L78 Accepts]: Start accepts. Automaton has 11898 states and 20829 transitions. Word has length 112 [2024-10-11 02:53:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:30,559 INFO L471 AbstractCegarLoop]: Abstraction has 11898 states and 20829 transitions. [2024-10-11 02:53:30,562 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 11898 states and 20829 transitions. [2024-10-11 02:53:30,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:53:30,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:30,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:30,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:53:30,585 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:30,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:30,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2106523779, now seen corresponding path program 1 times [2024-10-11 02:53:30,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:30,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672884794] [2024-10-11 02:53:30,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:30,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:53:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:53:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:53:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:53:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:53:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:53:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:30,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672884794] [2024-10-11 02:53:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672884794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246148499] [2024-10-11 02:53:30,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:30,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:30,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:30,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:30,694 INFO L87 Difference]: Start difference. First operand 11898 states and 20829 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:32,586 INFO L93 Difference]: Finished difference Result 28581 states and 50640 transitions. [2024-10-11 02:53:32,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:32,587 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-10-11 02:53:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:32,667 INFO L225 Difference]: With dead ends: 28581 [2024-10-11 02:53:32,667 INFO L226 Difference]: Without dead ends: 18718 [2024-10-11 02:53:32,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:32,697 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 1303 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:32,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 864 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:53:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18718 states. [2024-10-11 02:53:33,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18718 to 18570. [2024-10-11 02:53:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18570 states, 15274 states have (on average 1.6604032997250229) internal successors, (25361), 15280 states have internal predecessors, (25361), 3270 states have call successors, (3270), 21 states have call predecessors, (3270), 25 states have return successors, (3609), 3268 states have call predecessors, (3609), 3269 states have call successors, (3609) [2024-10-11 02:53:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18570 states to 18570 states and 32240 transitions. [2024-10-11 02:53:33,438 INFO L78 Accepts]: Start accepts. Automaton has 18570 states and 32240 transitions. Word has length 113 [2024-10-11 02:53:33,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:33,439 INFO L471 AbstractCegarLoop]: Abstraction has 18570 states and 32240 transitions. [2024-10-11 02:53:33,439 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:33,439 INFO L276 IsEmpty]: Start isEmpty. Operand 18570 states and 32240 transitions. [2024-10-11 02:53:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:53:33,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:33,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:33,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:53:33,464 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:33,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1362906056, now seen corresponding path program 1 times [2024-10-11 02:53:33,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:33,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293425006] [2024-10-11 02:53:33,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:33,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:53:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:53:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:53:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:53:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:53:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:53:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293425006] [2024-10-11 02:53:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293425006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:33,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:33,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616564459] [2024-10-11 02:53:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:33,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:33,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:33,590 INFO L87 Difference]: Start difference. First operand 18570 states and 32240 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:35,959 INFO L93 Difference]: Finished difference Result 49214 states and 86961 transitions. [2024-10-11 02:53:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:35,960 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2024-10-11 02:53:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:36,127 INFO L225 Difference]: With dead ends: 49214 [2024-10-11 02:53:36,128 INFO L226 Difference]: Without dead ends: 33299 [2024-10-11 02:53:36,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:36,202 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1303 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:36,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 878 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:53:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33299 states. [2024-10-11 02:53:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33299 to 33151. [2024-10-11 02:53:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33151 states, 27405 states have (on average 1.6575077540594783) internal successors, (45424), 27411 states have internal predecessors, (45424), 5720 states have call successors, (5720), 21 states have call predecessors, (5720), 25 states have return successors, (6333), 5718 states have call predecessors, (6333), 5719 states have call successors, (6333) [2024-10-11 02:53:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33151 states to 33151 states and 57477 transitions. [2024-10-11 02:53:37,817 INFO L78 Accepts]: Start accepts. Automaton has 33151 states and 57477 transitions. Word has length 114 [2024-10-11 02:53:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:37,817 INFO L471 AbstractCegarLoop]: Abstraction has 33151 states and 57477 transitions. [2024-10-11 02:53:37,818 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 33151 states and 57477 transitions. [2024-10-11 02:53:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:53:37,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:37,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:37,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:53:37,841 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:37,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:37,841 INFO L85 PathProgramCache]: Analyzing trace with hash 533599293, now seen corresponding path program 1 times [2024-10-11 02:53:37,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:37,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406133074] [2024-10-11 02:53:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:37,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:53:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:53:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:53:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:53:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:53:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:53:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:37,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406133074] [2024-10-11 02:53:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406133074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:37,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:37,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:37,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720168244] [2024-10-11 02:53:37,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:37,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:37,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:37,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:37,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:37,946 INFO L87 Difference]: Start difference. First operand 33151 states and 57477 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:40,939 INFO L93 Difference]: Finished difference Result 90516 states and 159185 transitions. [2024-10-11 02:53:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:40,939 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-10-11 02:53:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:41,439 INFO L225 Difference]: With dead ends: 90516 [2024-10-11 02:53:41,440 INFO L226 Difference]: Without dead ends: 60911 [2024-10-11 02:53:41,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:41,522 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1301 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:41,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 883 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:53:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60911 states. [2024-10-11 02:53:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60911 to 60763. [2024-10-11 02:53:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60763 states, 50504 states have (on average 1.65373039759227) internal successors, (83520), 50510 states have internal predecessors, (83520), 10233 states have call successors, (10233), 21 states have call predecessors, (10233), 25 states have return successors, (11378), 10231 states have call predecessors, (11378), 10232 states have call successors, (11378) [2024-10-11 02:53:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60763 states to 60763 states and 105131 transitions. [2024-10-11 02:53:43,980 INFO L78 Accepts]: Start accepts. Automaton has 60763 states and 105131 transitions. Word has length 115 [2024-10-11 02:53:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:43,981 INFO L471 AbstractCegarLoop]: Abstraction has 60763 states and 105131 transitions. [2024-10-11 02:53:43,981 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 60763 states and 105131 transitions. [2024-10-11 02:53:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:53:44,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:44,390 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:44,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:53:44,394 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:44,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:44,395 INFO L85 PathProgramCache]: Analyzing trace with hash -895122632, now seen corresponding path program 1 times [2024-10-11 02:53:44,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:44,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450374241] [2024-10-11 02:53:44,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:44,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:53:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:53:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:53:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:53:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:53:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:53:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:44,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:44,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450374241] [2024-10-11 02:53:44,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450374241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:44,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:44,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:53:44,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630687741] [2024-10-11 02:53:44,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:44,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:53:44,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:44,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:53:44,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:53:44,576 INFO L87 Difference]: Start difference. First operand 60763 states and 105131 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:48,039 INFO L93 Difference]: Finished difference Result 113868 states and 200795 transitions. [2024-10-11 02:53:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:48,040 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-11 02:53:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:48,825 INFO L225 Difference]: With dead ends: 113868 [2024-10-11 02:53:48,825 INFO L226 Difference]: Without dead ends: 113705 [2024-10-11 02:53:48,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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-11 02:53:48,873 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1293 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:48,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 895 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:53:48,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113705 states. [2024-10-11 02:53:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113705 to 113557. [2024-10-11 02:53:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113557 states, 94930 states have (on average 1.648920257031497) internal successors, (156532), 94936 states have internal predecessors, (156532), 18601 states have call successors, (18601), 21 states have call predecessors, (18601), 25 states have return successors, (20792), 18599 states have call predecessors, (20792), 18600 states have call successors, (20792) [2024-10-11 02:53:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113557 states to 113557 states and 195925 transitions. [2024-10-11 02:53:53,264 INFO L78 Accepts]: Start accepts. Automaton has 113557 states and 195925 transitions. Word has length 116 [2024-10-11 02:53:53,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:53,265 INFO L471 AbstractCegarLoop]: Abstraction has 113557 states and 195925 transitions. [2024-10-11 02:53:53,265 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:53:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 113557 states and 195925 transitions. [2024-10-11 02:53:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:53:53,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:53,298 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:53,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:53:53,299 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:53,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1994093468, now seen corresponding path program 1 times [2024-10-11 02:53:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:53,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296466245] [2024-10-11 02:53:53,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:53,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:53:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:53:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:53:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:53:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:53:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:53:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:53,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:53,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296466245] [2024-10-11 02:53:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296466245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:53,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:53:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129034619] [2024-10-11 02:53:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:53,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:53:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:53:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:53:53,901 INFO L87 Difference]: Start difference. First operand 113557 states and 195925 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 02:53:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:57,718 INFO L93 Difference]: Finished difference Result 113698 states and 199452 transitions. [2024-10-11 02:53:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:53:57,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 02:53:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:57,756 INFO L225 Difference]: With dead ends: 113698 [2024-10-11 02:53:57,756 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 02:53:58,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:53:58,102 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1181 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 3086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:58,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1207 Invalid, 3086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:53:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 02:53:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 02:53:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 02:53:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 02:53:58,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2024-10-11 02:53:58,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:58,127 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 02:53:58,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 02:53:58,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 02:53:58,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 02:53:58,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:53:58,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:53:58,132 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:58,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 02:54:05,452 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 1122 DAG size of output: 3 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)