./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_product32.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 50599b90019c0f8b15701a8959406dc5e052f09e6cd358b81cb6701fde5581e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:58:36,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:58:37,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:58:37,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:58:37,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:58:37,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:58:37,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:58:37,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:58:37,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:58:37,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:58:37,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:58:37,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:58:37,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:58:37,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:58:37,108 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:58:37,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:58:37,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:58:37,110 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:58:37,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:58:37,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:58:37,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:58:37,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:58:37,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:58:37,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:58:37,111 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:37,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:58:37,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:58:37,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:58:37,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:58:37,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:37,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:58:37,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:58:37,112 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:58:37,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:58:37,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:58:37,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:58:37,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:58:37,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:58:37,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:58:37,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:58:37,114 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> 50599b90019c0f8b15701a8959406dc5e052f09e6cd358b81cb6701fde5581e5 [2025-01-09 03:58:37,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:58:37,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:58:37,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:58:37,409 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:58:37,410 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:58:37,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product32.cil.c [2025-01-09 03:58:38,773 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc5009e2b/adb836d80508401db76ffb9aa4b44f43/FLAGab2a28844 [2025-01-09 03:58:39,222 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:58:39,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product32.cil.c [2025-01-09 03:58:39,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc5009e2b/adb836d80508401db76ffb9aa4b44f43/FLAGab2a28844 [2025-01-09 03:58:39,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc5009e2b/adb836d80508401db76ffb9aa4b44f43 [2025-01-09 03:58:39,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:58:39,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:58:39,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:58:39,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:58:39,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:58:39,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:39" (1/1) ... [2025-01-09 03:58:39,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3773ebaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:39, skipping insertion in model container [2025-01-09 03:58:39,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:39" (1/1) ... [2025-01-09 03:58:39,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:58:39,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product32.cil.c[51167,51180] [2025-01-09 03:58:39,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:58:39,989 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:58:39,999 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-01-09 03:58:40,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [208] [2025-01-09 03:58:40,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [437] [2025-01-09 03:58:40,000 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [859] [2025-01-09 03:58:40,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1256] [2025-01-09 03:58:40,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1273] [2025-01-09 03:58:40,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2345] [2025-01-09 03:58:40,001 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2383] [2025-01-09 03:58:40,002 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2392] [2025-01-09 03:58:40,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2434] [2025-01-09 03:58:40,003 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2800] [2025-01-09 03:58:40,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product32.cil.c[51167,51180] [2025-01-09 03:58:40,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:58:40,155 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:58:40,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40 WrapperNode [2025-01-09 03:58:40,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:58:40,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:58:40,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:58:40,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:58:40,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,236 INFO L138 Inliner]: procedures = 135, calls = 222, calls flagged for inlining = 62, calls inlined = 54, statements flattened = 996 [2025-01-09 03:58:40,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:58:40,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:58:40,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:58:40,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:58:40,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,294 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:58:40,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:58:40,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:58:40,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:58:40,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:58:40,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (1/1) ... [2025-01-09 03:58:40,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:40,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:40,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:58:40,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:58:40,438 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:58:40,438 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:58:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:58:40,439 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:58:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:58:40,439 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:58:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:58:40,440 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:58:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:58:40,441 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:58:40,441 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:58:40,441 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:58:40,441 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:58:40,441 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:58:40,441 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:58:40,442 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:58:40,442 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:58:40,442 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:58:40,442 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:58:40,442 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:58:40,442 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:58:40,443 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:58:40,443 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:58:40,444 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:58:40,444 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:58:40,444 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:58:40,444 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:58:40,444 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:58:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:58:40,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:58:40,681 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:58:40,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:58:41,720 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2025-01-09 03:58:41,721 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:58:41,751 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:58:41,755 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:58:41,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:41 BoogieIcfgContainer [2025-01-09 03:58:41,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:58:41,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:58:41,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:58:41,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:58:41,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:58:39" (1/3) ... [2025-01-09 03:58:41,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@843813a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:41, skipping insertion in model container [2025-01-09 03:58:41,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:40" (2/3) ... [2025-01-09 03:58:41,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@843813a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:41, skipping insertion in model container [2025-01-09 03:58:41,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:41" (3/3) ... [2025-01-09 03:58:41,768 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_product32.cil.c [2025-01-09 03:58:41,783 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:58:41,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_product32.cil.c that has 29 procedures, 425 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:58:41,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:58:41,884 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;@2990332c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:58:41,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:58:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 425 states, 330 states have (on average 1.5484848484848486) internal successors, (511), 335 states have internal predecessors, (511), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 03:58:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:58:41,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:41,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:41,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 33425701, now seen corresponding path program 1 times [2025-01-09 03:58:41,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:41,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084730813] [2025-01-09 03:58:41,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:42,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:58:42,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:58:42,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:42,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:58:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084730813] [2025-01-09 03:58:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084730813] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:42,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235324523] [2025-01-09 03:58:42,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:42,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:42,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:42,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:42,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:58:42,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:58:43,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:58:43,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:43,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:43,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:58:43,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:58:43,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:43,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235324523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:43,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:43,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:58:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559145055] [2025-01-09 03:58:43,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:43,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:43,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:43,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:43,210 INFO L87 Difference]: Start difference. First operand has 425 states, 330 states have (on average 1.5484848484848486) internal successors, (511), 335 states have internal predecessors, (511), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:43,311 INFO L93 Difference]: Finished difference Result 660 states and 978 transitions. [2025-01-09 03:58:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-01-09 03:58:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:43,333 INFO L225 Difference]: With dead ends: 660 [2025-01-09 03:58:43,334 INFO L226 Difference]: Without dead ends: 420 [2025-01-09 03:58:43,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:43,345 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 1 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:43,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1269 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-01-09 03:58:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 419. [2025-01-09 03:58:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 325 states have (on average 1.5446153846153847) internal successors, (502), 329 states have internal predecessors, (502), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 03:58:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 631 transitions. [2025-01-09 03:58:43,442 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 631 transitions. Word has length 110 [2025-01-09 03:58:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:43,444 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 631 transitions. [2025-01-09 03:58:43,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 631 transitions. [2025-01-09 03:58:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:58:43,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:43,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:43,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:58:43,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:58:43,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:43,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 894383672, now seen corresponding path program 1 times [2025-01-09 03:58:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968406620] [2025-01-09 03:58:43,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:43,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:58:43,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:58:43,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:43,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:58:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968406620] [2025-01-09 03:58:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968406620] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880276494] [2025-01-09 03:58:44,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:44,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:44,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:58:44,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:58:44,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:58:44,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:44,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:44,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:58:44,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:58:44,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:44,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880276494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:44,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:58:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190066467] [2025-01-09 03:58:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:44,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:44,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:44,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:44,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:44,421 INFO L87 Difference]: Start difference. First operand 419 states and 631 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:44,489 INFO L93 Difference]: Finished difference Result 886 states and 1354 transitions. [2025-01-09 03:58:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-01-09 03:58:44,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:44,498 INFO L225 Difference]: With dead ends: 886 [2025-01-09 03:58:44,498 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 03:58:44,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:44,504 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 134 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:44,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1231 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 03:58:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 485. [2025-01-09 03:58:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 377 states have (on average 1.5649867374005304) internal successors, (590), 381 states have internal predecessors, (590), 79 states have call successors, (79), 28 states have call predecessors, (79), 28 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 03:58:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 747 transitions. [2025-01-09 03:58:44,557 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 747 transitions. Word has length 118 [2025-01-09 03:58:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:44,559 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 747 transitions. [2025-01-09 03:58:44,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 747 transitions. [2025-01-09 03:58:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:58:44,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:44,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:44,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:58:44,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:44,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:44,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash 340154202, now seen corresponding path program 1 times [2025-01-09 03:58:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:44,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037494043] [2025-01-09 03:58:44,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:44,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:58:44,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:58:44,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:44,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:58:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037494043] [2025-01-09 03:58:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037494043] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616256563] [2025-01-09 03:58:45,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:45,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:45,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:45,066 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:45,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:58:45,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:58:45,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:58:45,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:45,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:45,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:58:45,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:45,481 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:58:45,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:45,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616256563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:45,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:58:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580947792] [2025-01-09 03:58:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:45,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:45,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:45,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:58:45,486 INFO L87 Difference]: Start difference. First operand 485 states and 747 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:45,584 INFO L93 Difference]: Finished difference Result 961 states and 1484 transitions. [2025-01-09 03:58:45,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:45,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-01-09 03:58:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:45,591 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:58:45,591 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 03:58:45,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:58:45,594 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 2 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:45,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2477 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 03:58:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2025-01-09 03:58:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 378 states have (on average 1.5634920634920635) internal successors, (591), 383 states have internal predecessors, (591), 79 states have call successors, (79), 28 states have call predecessors, (79), 29 states have return successors, (80), 77 states have call predecessors, (80), 78 states have call successors, (80) [2025-01-09 03:58:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 750 transitions. [2025-01-09 03:58:45,634 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 750 transitions. Word has length 119 [2025-01-09 03:58:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:45,634 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 750 transitions. [2025-01-09 03:58:45,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 750 transitions. [2025-01-09 03:58:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:58:45,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:45,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:45,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:58:45,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:45,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:45,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash -91955040, now seen corresponding path program 1 times [2025-01-09 03:58:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435169370] [2025-01-09 03:58:45,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:45,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:58:45,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:58:45,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:45,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:58:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435169370] [2025-01-09 03:58:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435169370] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874634977] [2025-01-09 03:58:46,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:46,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:46,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:46,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:46,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:58:46,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:58:46,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:58:46,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:46,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:46,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:58:46,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:58:46,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874634977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:46,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:46,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:58:46,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870355199] [2025-01-09 03:58:46,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:46,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:46,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:46,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:46,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:58:46,450 INFO L87 Difference]: Start difference. First operand 487 states and 750 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:46,529 INFO L93 Difference]: Finished difference Result 963 states and 1489 transitions. [2025-01-09 03:58:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:46,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-01-09 03:58:46,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:46,534 INFO L225 Difference]: With dead ends: 963 [2025-01-09 03:58:46,534 INFO L226 Difference]: Without dead ends: 489 [2025-01-09 03:58:46,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:58:46,537 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 2 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:46,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2463 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-01-09 03:58:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-01-09 03:58:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 379 states have (on average 1.562005277044855) internal successors, (592), 385 states have internal predecessors, (592), 79 states have call successors, (79), 28 states have call predecessors, (79), 30 states have return successors, (85), 77 states have call predecessors, (85), 78 states have call successors, (85) [2025-01-09 03:58:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 756 transitions. [2025-01-09 03:58:46,568 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 756 transitions. Word has length 120 [2025-01-09 03:58:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:46,569 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 756 transitions. [2025-01-09 03:58:46,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 756 transitions. [2025-01-09 03:58:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:58:46,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:46,573 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:46,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:58:46,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:46,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash -580324625, now seen corresponding path program 1 times [2025-01-09 03:58:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:46,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451893740] [2025-01-09 03:58:46,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:58:46,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:58:46,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:46,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:58:46,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451893740] [2025-01-09 03:58:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451893740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:46,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641058183] [2025-01-09 03:58:46,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:46,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:46,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:46,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:46,974 INFO L87 Difference]: Start difference. First operand 489 states and 756 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:47,055 INFO L93 Difference]: Finished difference Result 955 states and 1480 transitions. [2025-01-09 03:58:47,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:47,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-01-09 03:58:47,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:47,063 INFO L225 Difference]: With dead ends: 955 [2025-01-09 03:58:47,063 INFO L226 Difference]: Without dead ends: 489 [2025-01-09 03:58:47,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:47,065 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 2 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:47,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2481 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-01-09 03:58:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-01-09 03:58:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 379 states have (on average 1.562005277044855) internal successors, (592), 385 states have internal predecessors, (592), 79 states have call successors, (79), 28 states have call predecessors, (79), 30 states have return successors, (84), 77 states have call predecessors, (84), 78 states have call successors, (84) [2025-01-09 03:58:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 755 transitions. [2025-01-09 03:58:47,108 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 755 transitions. Word has length 121 [2025-01-09 03:58:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:47,109 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 755 transitions. [2025-01-09 03:58:47,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 755 transitions. [2025-01-09 03:58:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:58:47,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:47,114 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:47,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:58:47,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:47,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1645324883, now seen corresponding path program 2 times [2025-01-09 03:58:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596350112] [2025-01-09 03:58:47,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:58:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:47,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-01-09 03:58:47,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:58:47,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:58:47,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:58:47,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:47,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596350112] [2025-01-09 03:58:47,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596350112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:47,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:47,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393603236] [2025-01-09 03:58:47,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:47,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:47,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:47,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:47,289 INFO L87 Difference]: Start difference. First operand 489 states and 755 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:47,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:47,356 INFO L93 Difference]: Finished difference Result 953 states and 1475 transitions. [2025-01-09 03:58:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:47,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-01-09 03:58:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:47,365 INFO L225 Difference]: With dead ends: 953 [2025-01-09 03:58:47,366 INFO L226 Difference]: Without dead ends: 489 [2025-01-09 03:58:47,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:47,369 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 2 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2467 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:47,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2467 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-01-09 03:58:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-01-09 03:58:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 379 states have (on average 1.562005277044855) internal successors, (592), 385 states have internal predecessors, (592), 79 states have call successors, (79), 28 states have call predecessors, (79), 30 states have return successors, (83), 77 states have call predecessors, (83), 78 states have call successors, (83) [2025-01-09 03:58:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 754 transitions. [2025-01-09 03:58:47,398 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 754 transitions. Word has length 122 [2025-01-09 03:58:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:47,399 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 754 transitions. [2025-01-09 03:58:47,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 754 transitions. [2025-01-09 03:58:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:58:47,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:47,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:47,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:58:47,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:47,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -379655296, now seen corresponding path program 3 times [2025-01-09 03:58:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938622668] [2025-01-09 03:58:47,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:58:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:47,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 123 statements into 3 equivalence classes. [2025-01-09 03:58:47,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 111 of 123 statements. [2025-01-09 03:58:47,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:58:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:58:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938622668] [2025-01-09 03:58:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938622668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:47,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902973087] [2025-01-09 03:58:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:47,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:47,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:47,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:47,556 INFO L87 Difference]: Start difference. First operand 489 states and 754 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:47,622 INFO L93 Difference]: Finished difference Result 955 states and 1481 transitions. [2025-01-09 03:58:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:47,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-01-09 03:58:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:47,629 INFO L225 Difference]: With dead ends: 955 [2025-01-09 03:58:47,629 INFO L226 Difference]: Without dead ends: 491 [2025-01-09 03:58:47,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:47,633 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:47,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2478 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-01-09 03:58:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2025-01-09 03:58:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 380 states have (on average 1.5605263157894738) internal successors, (593), 387 states have internal predecessors, (593), 79 states have call successors, (79), 28 states have call predecessors, (79), 31 states have return successors, (88), 77 states have call predecessors, (88), 78 states have call successors, (88) [2025-01-09 03:58:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 760 transitions. [2025-01-09 03:58:47,660 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 760 transitions. Word has length 123 [2025-01-09 03:58:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:47,660 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 760 transitions. [2025-01-09 03:58:47,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 760 transitions. [2025-01-09 03:58:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:58:47,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:47,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:58:47,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:47,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1374126600, now seen corresponding path program 1 times [2025-01-09 03:58:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460734289] [2025-01-09 03:58:47,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:47,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:58:47,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:58:47,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:47,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:58:47,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:47,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460734289] [2025-01-09 03:58:47,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460734289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:47,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170060391] [2025-01-09 03:58:47,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:47,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:47,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:47,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:47,834 INFO L87 Difference]: Start difference. First operand 491 states and 760 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:47,893 INFO L93 Difference]: Finished difference Result 961 states and 1491 transitions. [2025-01-09 03:58:47,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:47,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 124 [2025-01-09 03:58:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:47,899 INFO L225 Difference]: With dead ends: 961 [2025-01-09 03:58:47,899 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 03:58:47,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:47,902 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 1 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:47,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2484 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 03:58:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-01-09 03:58:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 381 states have (on average 1.5590551181102361) internal successors, (594), 389 states have internal predecessors, (594), 79 states have call successors, (79), 28 states have call predecessors, (79), 32 states have return successors, (90), 77 states have call predecessors, (90), 78 states have call successors, (90) [2025-01-09 03:58:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 763 transitions. [2025-01-09 03:58:47,928 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 763 transitions. Word has length 124 [2025-01-09 03:58:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:47,928 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 763 transitions. [2025-01-09 03:58:47,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 03:58:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 763 transitions. [2025-01-09 03:58:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:58:47,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:47,931 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:47,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:58:47,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -386616039, now seen corresponding path program 1 times [2025-01-09 03:58:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352507727] [2025-01-09 03:58:47,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:47,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:58:47,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:58:47,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:47,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:58:48,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:48,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352507727] [2025-01-09 03:58:48,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352507727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:48,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730193868] [2025-01-09 03:58:48,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:48,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:48,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:48,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:48,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:58:48,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:58:48,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:58:48,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:48,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:48,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:58:48,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:48,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:58:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:48,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730193868] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:58:48,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:58:48,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:58:48,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535454254] [2025-01-09 03:58:48,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:58:48,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:58:48,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:48,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:58:48,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:58:48,602 INFO L87 Difference]: Start difference. First operand 493 states and 763 transitions. Second operand has 11 states, 10 states have (on average 13.4) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-01-09 03:58:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:49,396 INFO L93 Difference]: Finished difference Result 1396 states and 2256 transitions. [2025-01-09 03:58:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:58:49,397 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.4) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 125 [2025-01-09 03:58:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:49,403 INFO L225 Difference]: With dead ends: 1396 [2025-01-09 03:58:49,403 INFO L226 Difference]: Without dead ends: 931 [2025-01-09 03:58:49,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:58:49,406 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 1625 mSDsluCounter, 3762 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 4376 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:49,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 4376 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:58:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-01-09 03:58:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 907. [2025-01-09 03:58:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 716 states have (on average 1.6145251396648044) internal successors, (1156), 723 states have internal predecessors, (1156), 158 states have call successors, (158), 29 states have call predecessors, (158), 32 states have return successors, (179), 156 states have call predecessors, (179), 157 states have call successors, (179) [2025-01-09 03:58:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1493 transitions. [2025-01-09 03:58:49,451 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1493 transitions. Word has length 125 [2025-01-09 03:58:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:49,451 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1493 transitions. [2025-01-09 03:58:49,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.4) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-01-09 03:58:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1493 transitions. [2025-01-09 03:58:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:58:49,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:49,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:49,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:58:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:49,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:49,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:49,658 INFO L85 PathProgramCache]: Analyzing trace with hash 271234656, now seen corresponding path program 1 times [2025-01-09 03:58:49,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:49,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942644434] [2025-01-09 03:58:49,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:49,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:58:49,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:58:49,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:49,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942644434] [2025-01-09 03:58:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942644434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:49,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:49,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042440160] [2025-01-09 03:58:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:49,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:49,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:49,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:49,733 INFO L87 Difference]: Start difference. First operand 907 states and 1493 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:49,790 INFO L93 Difference]: Finished difference Result 2127 states and 3562 transitions. [2025-01-09 03:58:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:49,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-01-09 03:58:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:49,801 INFO L225 Difference]: With dead ends: 2127 [2025-01-09 03:58:49,802 INFO L226 Difference]: Without dead ends: 1298 [2025-01-09 03:58:49,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:49,806 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 131 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:49,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1258 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-01-09 03:58:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1290. [2025-01-09 03:58:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1020 states have (on average 1.6362745098039215) internal successors, (1669), 1027 states have internal predecessors, (1669), 237 states have call successors, (237), 29 states have call predecessors, (237), 32 states have return successors, (268), 235 states have call predecessors, (268), 236 states have call successors, (268) [2025-01-09 03:58:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 2174 transitions. [2025-01-09 03:58:49,886 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 2174 transitions. Word has length 129 [2025-01-09 03:58:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:49,886 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 2174 transitions. [2025-01-09 03:58:49,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 2174 transitions. [2025-01-09 03:58:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:58:49,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:49,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:49,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:58:49,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:49,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1282057213, now seen corresponding path program 1 times [2025-01-09 03:58:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988439682] [2025-01-09 03:58:49,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:49,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:58:49,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:58:49,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:49,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:49,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988439682] [2025-01-09 03:58:49,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988439682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:49,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:49,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:49,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357245248] [2025-01-09 03:58:49,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:49,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:50,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:50,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:50,000 INFO L87 Difference]: Start difference. First operand 1290 states and 2174 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:50,100 INFO L93 Difference]: Finished difference Result 3084 states and 5238 transitions. [2025-01-09 03:58:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-01-09 03:58:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:50,115 INFO L225 Difference]: With dead ends: 3084 [2025-01-09 03:58:50,116 INFO L226 Difference]: Without dead ends: 1923 [2025-01-09 03:58:50,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:50,123 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 129 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:50,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1250 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-01-09 03:58:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1915. [2025-01-09 03:58:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1526 states have (on average 1.6480996068152032) internal successors, (2515), 1533 states have internal predecessors, (2515), 356 states have call successors, (356), 29 states have call predecessors, (356), 32 states have return successors, (387), 354 states have call predecessors, (387), 355 states have call successors, (387) [2025-01-09 03:58:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 3258 transitions. [2025-01-09 03:58:50,262 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 3258 transitions. Word has length 130 [2025-01-09 03:58:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:50,262 INFO L471 AbstractCegarLoop]: Abstraction has 1915 states and 3258 transitions. [2025-01-09 03:58:50,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 3258 transitions. [2025-01-09 03:58:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:58:50,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:50,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:50,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:58:50,275 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:50,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:50,276 INFO L85 PathProgramCache]: Analyzing trace with hash -497681038, now seen corresponding path program 1 times [2025-01-09 03:58:50,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:50,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356201730] [2025-01-09 03:58:50,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:50,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:50,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:58:50,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:58:50,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:50,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356201730] [2025-01-09 03:58:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356201730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:50,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:50,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370438892] [2025-01-09 03:58:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:50,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:50,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:50,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:50,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:50,345 INFO L87 Difference]: Start difference. First operand 1915 states and 3258 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:50,452 INFO L93 Difference]: Finished difference Result 4536 states and 7787 transitions. [2025-01-09 03:58:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:50,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-01-09 03:58:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:50,474 INFO L225 Difference]: With dead ends: 4536 [2025-01-09 03:58:50,474 INFO L226 Difference]: Without dead ends: 2881 [2025-01-09 03:58:50,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:50,483 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 127 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:50,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1247 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2025-01-09 03:58:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2873. [2025-01-09 03:58:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2873 states, 2322 states have (on average 1.6576227390180878) internal successors, (3849), 2329 states have internal predecessors, (3849), 518 states have call successors, (518), 29 states have call predecessors, (518), 32 states have return successors, (565), 516 states have call predecessors, (565), 517 states have call successors, (565) [2025-01-09 03:58:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2873 states to 2873 states and 4932 transitions. [2025-01-09 03:58:50,670 INFO L78 Accepts]: Start accepts. Automaton has 2873 states and 4932 transitions. Word has length 131 [2025-01-09 03:58:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:50,670 INFO L471 AbstractCegarLoop]: Abstraction has 2873 states and 4932 transitions. [2025-01-09 03:58:50,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2873 states and 4932 transitions. [2025-01-09 03:58:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:58:50,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:50,687 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:50,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:58:50,687 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:50,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -79362660, now seen corresponding path program 1 times [2025-01-09 03:58:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163851487] [2025-01-09 03:58:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:50,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:58:50,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:58:50,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:50,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:50,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163851487] [2025-01-09 03:58:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163851487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:50,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:50,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007836920] [2025-01-09 03:58:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:50,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:50,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:50,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:50,748 INFO L87 Difference]: Start difference. First operand 2873 states and 4932 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:50,886 INFO L93 Difference]: Finished difference Result 6829 states and 11819 transitions. [2025-01-09 03:58:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:50,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-01-09 03:58:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:50,915 INFO L225 Difference]: With dead ends: 6829 [2025-01-09 03:58:50,915 INFO L226 Difference]: Without dead ends: 4428 [2025-01-09 03:58:50,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:50,928 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 125 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:50,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1247 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4428 states. [2025-01-09 03:58:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4428 to 4420. [2025-01-09 03:58:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4420 states, 3624 states have (on average 1.664459161147903) internal successors, (6032), 3631 states have internal predecessors, (6032), 763 states have call successors, (763), 29 states have call predecessors, (763), 32 states have return successors, (836), 761 states have call predecessors, (836), 762 states have call successors, (836) [2025-01-09 03:58:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 7631 transitions. [2025-01-09 03:58:51,216 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 7631 transitions. Word has length 132 [2025-01-09 03:58:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:51,216 INFO L471 AbstractCegarLoop]: Abstraction has 4420 states and 7631 transitions. [2025-01-09 03:58:51,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 7631 transitions. [2025-01-09 03:58:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 03:58:51,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:51,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:51,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:58:51,239 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:51,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 934310934, now seen corresponding path program 1 times [2025-01-09 03:58:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567134327] [2025-01-09 03:58:51,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:51,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 03:58:51,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 03:58:51,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:51,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567134327] [2025-01-09 03:58:51,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567134327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:51,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:51,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:51,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763472592] [2025-01-09 03:58:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:51,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:51,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:51,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:51,303 INFO L87 Difference]: Start difference. First operand 4420 states and 7631 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:51,530 INFO L93 Difference]: Finished difference Result 10923 states and 18971 transitions. [2025-01-09 03:58:51,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-01-09 03:58:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:51,582 INFO L225 Difference]: With dead ends: 10923 [2025-01-09 03:58:51,582 INFO L226 Difference]: Without dead ends: 7216 [2025-01-09 03:58:51,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:51,639 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 123 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:51,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1256 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7216 states. [2025-01-09 03:58:51,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7216 to 7208. [2025-01-09 03:58:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7208 states, 5919 states have (on average 1.6617671904037845) internal successors, (9836), 5926 states have internal predecessors, (9836), 1256 states have call successors, (1256), 29 states have call predecessors, (1256), 32 states have return successors, (1373), 1254 states have call predecessors, (1373), 1255 states have call successors, (1373) [2025-01-09 03:58:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7208 states to 7208 states and 12465 transitions. [2025-01-09 03:58:52,058 INFO L78 Accepts]: Start accepts. Automaton has 7208 states and 12465 transitions. Word has length 133 [2025-01-09 03:58:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 7208 states and 12465 transitions. [2025-01-09 03:58:52,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 7208 states and 12465 transitions. [2025-01-09 03:58:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 03:58:52,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:52,123 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:52,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:58:52,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:52,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash -447502600, now seen corresponding path program 1 times [2025-01-09 03:58:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:52,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990781621] [2025-01-09 03:58:52,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:52,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 03:58:52,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 03:58:52,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:52,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:52,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:52,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990781621] [2025-01-09 03:58:52,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990781621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:52,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:52,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332275493] [2025-01-09 03:58:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:52,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:52,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:52,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:52,211 INFO L87 Difference]: Start difference. First operand 7208 states and 12465 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:52,684 INFO L93 Difference]: Finished difference Result 18210 states and 31691 transitions. [2025-01-09 03:58:52,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:52,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-01-09 03:58:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:52,776 INFO L225 Difference]: With dead ends: 18210 [2025-01-09 03:58:52,777 INFO L226 Difference]: Without dead ends: 12101 [2025-01-09 03:58:52,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:52,812 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 121 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:52,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1258 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:52,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12101 states. [2025-01-09 03:58:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12101 to 12093. [2025-01-09 03:58:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12093 states, 9982 states have (on average 1.6622921258264878) internal successors, (16593), 9989 states have internal predecessors, (16593), 2078 states have call successors, (2078), 29 states have call predecessors, (2078), 32 states have return successors, (2273), 2076 states have call predecessors, (2273), 2077 states have call successors, (2273) [2025-01-09 03:58:53,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12093 states to 12093 states and 20944 transitions. [2025-01-09 03:58:53,510 INFO L78 Accepts]: Start accepts. Automaton has 12093 states and 20944 transitions. Word has length 134 [2025-01-09 03:58:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:53,511 INFO L471 AbstractCegarLoop]: Abstraction has 12093 states and 20944 transitions. [2025-01-09 03:58:53,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 12093 states and 20944 transitions. [2025-01-09 03:58:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 03:58:53,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:53,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:53,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:58:53,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:53,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash 184410292, now seen corresponding path program 1 times [2025-01-09 03:58:53,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:53,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906042170] [2025-01-09 03:58:53,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:53,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:53,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:58:53,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:58:53,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:53,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:53,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:53,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906042170] [2025-01-09 03:58:53,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906042170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:53,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:53,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:53,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347188484] [2025-01-09 03:58:53,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:53,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:53,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:53,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:53,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:53,723 INFO L87 Difference]: Start difference. First operand 12093 states and 20944 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:54,269 INFO L93 Difference]: Finished difference Result 28930 states and 50032 transitions. [2025-01-09 03:58:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:54,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-01-09 03:58:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:54,357 INFO L225 Difference]: With dead ends: 28930 [2025-01-09 03:58:54,357 INFO L226 Difference]: Without dead ends: 18888 [2025-01-09 03:58:54,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:54,399 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 119 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:54,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1230 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18888 states. [2025-01-09 03:58:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18888 to 18880. [2025-01-09 03:58:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18880 states, 15566 states have (on average 1.6379930618013618) internal successors, (25497), 15573 states have internal predecessors, (25497), 3281 states have call successors, (3281), 29 states have call predecessors, (3281), 32 states have return successors, (3620), 3279 states have call predecessors, (3620), 3280 states have call successors, (3620) [2025-01-09 03:58:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18880 states to 18880 states and 32398 transitions. [2025-01-09 03:58:55,486 INFO L78 Accepts]: Start accepts. Automaton has 18880 states and 32398 transitions. Word has length 135 [2025-01-09 03:58:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:55,486 INFO L471 AbstractCegarLoop]: Abstraction has 18880 states and 32398 transitions. [2025-01-09 03:58:55,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 18880 states and 32398 transitions. [2025-01-09 03:58:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:58:55,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:55,530 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:55,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:58:55,531 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:55,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1084135177, now seen corresponding path program 1 times [2025-01-09 03:58:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:55,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831224622] [2025-01-09 03:58:55,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:55,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:55,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:58:55,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:58:55,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:55,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831224622] [2025-01-09 03:58:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831224622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452212323] [2025-01-09 03:58:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:55,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:55,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:55,624 INFO L87 Difference]: Start difference. First operand 18880 states and 32398 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:56,677 INFO L93 Difference]: Finished difference Result 49922 states and 85970 transitions. [2025-01-09 03:58:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:56,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-01-09 03:58:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:56,861 INFO L225 Difference]: With dead ends: 49922 [2025-01-09 03:58:56,861 INFO L226 Difference]: Without dead ends: 33706 [2025-01-09 03:58:56,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:56,930 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 117 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:56,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1250 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33706 states. [2025-01-09 03:58:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33706 to 33698. [2025-01-09 03:58:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33698 states, 27934 states have (on average 1.6345671941003794) internal successors, (45660), 27941 states have internal predecessors, (45660), 5731 states have call successors, (5731), 29 states have call predecessors, (5731), 32 states have return successors, (6344), 5729 states have call predecessors, (6344), 5730 states have call successors, (6344) [2025-01-09 03:58:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33698 states to 33698 states and 57735 transitions. [2025-01-09 03:58:58,597 INFO L78 Accepts]: Start accepts. Automaton has 33698 states and 57735 transitions. Word has length 136 [2025-01-09 03:58:58,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:58,598 INFO L471 AbstractCegarLoop]: Abstraction has 33698 states and 57735 transitions. [2025-01-09 03:58:58,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:58:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 33698 states and 57735 transitions. [2025-01-09 03:58:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 03:58:58,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:58,651 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:58:58,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:58:58,651 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:58,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1329914682, now seen corresponding path program 1 times [2025-01-09 03:58:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620964093] [2025-01-09 03:58:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:58,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 03:58:58,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 03:58:58,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:58,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:58:58,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:58,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620964093] [2025-01-09 03:58:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620964093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834678572] [2025-01-09 03:58:58,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:58,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:58,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:58,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:58,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:58,722 INFO L87 Difference]: Start difference. First operand 33698 states and 57735 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:59:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:00,507 INFO L93 Difference]: Finished difference Result 91959 states and 158002 transitions. [2025-01-09 03:59:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:00,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-01-09 03:59:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:00,910 INFO L225 Difference]: With dead ends: 91959 [2025-01-09 03:59:00,910 INFO L226 Difference]: Without dead ends: 61804 [2025-01-09 03:59:01,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:01,062 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 115 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:01,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1261 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61804 states. [2025-01-09 03:59:03,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61804 to 61796. [2025-01-09 03:59:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61796 states, 51519 states have (on average 1.6300005823094392) internal successors, (83976), 51526 states have internal predecessors, (83976), 10244 states have call successors, (10244), 29 states have call predecessors, (10244), 32 states have return successors, (11389), 10242 states have call predecessors, (11389), 10243 states have call successors, (11389) [2025-01-09 03:59:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61796 states to 61796 states and 105609 transitions. [2025-01-09 03:59:04,023 INFO L78 Accepts]: Start accepts. Automaton has 61796 states and 105609 transitions. Word has length 137 [2025-01-09 03:59:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:04,024 INFO L471 AbstractCegarLoop]: Abstraction has 61796 states and 105609 transitions. [2025-01-09 03:59:04,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:59:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 61796 states and 105609 transitions. [2025-01-09 03:59:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:59:04,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:04,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:04,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:59:04,075 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:04,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1199214857, now seen corresponding path program 1 times [2025-01-09 03:59:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:04,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356748584] [2025-01-09 03:59:04,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:04,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:59:04,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:59:04,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:04,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:59:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356748584] [2025-01-09 03:59:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356748584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:04,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:04,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775558472] [2025-01-09 03:59:04,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:04,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:04,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:04,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:04,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:04,149 INFO L87 Difference]: Start difference. First operand 61796 states and 105609 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:59:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:06,769 INFO L93 Difference]: Finished difference Result 115816 states and 198291 transitions. [2025-01-09 03:59:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-01-09 03:59:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:07,596 INFO L225 Difference]: With dead ends: 115816 [2025-01-09 03:59:07,597 INFO L226 Difference]: Without dead ends: 115589 [2025-01-09 03:59:07,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:07,656 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 110 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:07,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1264 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115589 states. [2025-01-09 03:59:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115589 to 115581. [2025-01-09 03:59:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115581 states, 96936 states have (on average 1.6243294544854336) internal successors, (157456), 96943 states have internal predecessors, (157456), 18612 states have call successors, (18612), 29 states have call predecessors, (18612), 32 states have return successors, (20803), 18610 states have call predecessors, (20803), 18611 states have call successors, (20803) [2025-01-09 03:59:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115581 states to 115581 states and 196871 transitions. [2025-01-09 03:59:11,627 INFO L78 Accepts]: Start accepts. Automaton has 115581 states and 196871 transitions. Word has length 138 [2025-01-09 03:59:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:11,628 INFO L471 AbstractCegarLoop]: Abstraction has 115581 states and 196871 transitions. [2025-01-09 03:59:11,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 03:59:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 115581 states and 196871 transitions. [2025-01-09 03:59:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:59:11,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:11,704 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:11,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:59:11,705 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:11,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:11,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1986725701, now seen corresponding path program 1 times [2025-01-09 03:59:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:11,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959507023] [2025-01-09 03:59:11,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:11,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:59:11,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:59:11,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:11,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:59:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959507023] [2025-01-09 03:59:12,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959507023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:12,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:12,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 03:59:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529409085] [2025-01-09 03:59:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:12,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:59:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:12,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:59:12,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:59:12,731 INFO L87 Difference]: Start difference. First operand 115581 states and 196871 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 03:59:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:19,124 INFO L93 Difference]: Finished difference Result 230491 states and 398016 transitions. [2025-01-09 03:59:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 03:59:19,124 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 139 [2025-01-09 03:59:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:20,335 INFO L225 Difference]: With dead ends: 230491 [2025-01-09 03:59:20,335 INFO L226 Difference]: Without dead ends: 230270 [2025-01-09 03:59:20,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-01-09 03:59:20,433 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1875 mSDsluCounter, 7467 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 8171 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:20,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 8171 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:59:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230270 states. [2025-01-09 03:59:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230270 to 230218. [2025-01-09 03:59:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230218 states, 193132 states have (on average 1.6248058322805128) internal successors, (313802), 193041 states have internal predecessors, (313802), 37002 states have call successors, (37002), 75 states have call predecessors, (37002), 83 states have return successors, (44671), 37109 states have call predecessors, (44671), 36999 states have call successors, (44671) [2025-01-09 03:59:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230218 states to 230218 states and 395475 transitions. [2025-01-09 03:59:29,674 INFO L78 Accepts]: Start accepts. Automaton has 230218 states and 395475 transitions. Word has length 139 [2025-01-09 03:59:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:29,675 INFO L471 AbstractCegarLoop]: Abstraction has 230218 states and 395475 transitions. [2025-01-09 03:59:29,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 03:59:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 230218 states and 395475 transitions. [2025-01-09 03:59:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:59:29,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:29,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:29,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:59:29,837 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:29,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash -113433153, now seen corresponding path program 1 times [2025-01-09 03:59:29,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:29,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655818187] [2025-01-09 03:59:29,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:29,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:59:29,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:59:29,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:29,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat