./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 c00e63dc 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-?-c00e63d-m [2025-02-05 15:50:01,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:50:01,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:50:01,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:50:01,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:50:01,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:50:01,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:50:01,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:50:01,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:50:01,104 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:50:01,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:50:01,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:50:01,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:50:01,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:50:01,106 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:50:01,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:50:01,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:50:01,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:50:01,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:50:01,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:50:01,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:50:01,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:50:01,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:50:01,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:50:01,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:50:01,109 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-02-05 15:50:01,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:50:01,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:50:01,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:50:01,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:50:01,365 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:50:01,366 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-02-05 15:50:02,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3dc955c4/8d0beba89b0d485ab0d46e54a66a1528/FLAG0fd26cc68 [2025-02-05 15:50:02,849 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:50:02,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product32.cil.c [2025-02-05 15:50:02,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3dc955c4/8d0beba89b0d485ab0d46e54a66a1528/FLAG0fd26cc68 [2025-02-05 15:50:02,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3dc955c4/8d0beba89b0d485ab0d46e54a66a1528 [2025-02-05 15:50:02,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:50:02,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:50:02,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:50:02,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:50:02,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:50:02,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:50:02" (1/1) ... [2025-02-05 15:50:02,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5867074e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:02, skipping insertion in model container [2025-02-05 15:50:02,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:50:02" (1/1) ... [2025-02-05 15:50:02,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:50:03,295 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-02-05 15:50:03,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:50:03,385 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:50:03,392 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-02-05 15:50:03,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [208] [2025-02-05 15:50:03,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [437] [2025-02-05 15:50:03,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [859] [2025-02-05 15:50:03,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1256] [2025-02-05 15:50:03,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1273] [2025-02-05 15:50:03,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2345] [2025-02-05 15:50:03,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2383] [2025-02-05 15:50:03,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2392] [2025-02-05 15:50:03,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2434] [2025-02-05 15:50:03,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2800] [2025-02-05 15:50:03,444 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-02-05 15:50:03,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:50:03,480 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:50:03,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03 WrapperNode [2025-02-05 15:50:03,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:50:03,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:50:03,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:50:03,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:50:03,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,554 INFO L138 Inliner]: procedures = 135, calls = 222, calls flagged for inlining = 62, calls inlined = 54, statements flattened = 996 [2025-02-05 15:50:03,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:50:03,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:50:03,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:50:03,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:50:03,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,589 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-02-05 15:50:03,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:50:03,625 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:50:03,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:50:03,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:50:03,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (1/1) ... [2025-02-05 15:50:03,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:50:03,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:50:03,652 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-02-05 15:50:03,655 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-02-05 15:50:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:50:03,675 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:50:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:50:03,675 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:50:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:50:03,675 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:50:03,675 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:50:03,676 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:50:03,676 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:50:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:50:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:50:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:50:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:50:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:50:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:50:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:50:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:50:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:50:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:50:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:50:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:50:03,677 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:50:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:50:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:50:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:50:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:50:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:50:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:50:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:50:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:50:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:50:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:50:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:50:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:50:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:50:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:50:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:50:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:50:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:50:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:50:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:50:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:50:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:50:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:50:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:50:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:50:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:50:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:50:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:50:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:50:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:50:03,679 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:50:03,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:50:03,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:50:03,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:50:03,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:50:03,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:50:03,680 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:50:03,680 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:50:03,680 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:50:03,680 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:50:03,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:50:03,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:50:03,853 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:50:03,857 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:50:03,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1163: #res := ~retValue_acc~17; [2025-02-05 15:50:03,970 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L755: #res := ~retValue_acc~8; [2025-02-05 15:50:03,998 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1979: #res#1 := ~retValue_acc~32#1; [2025-02-05 15:50:03,999 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1934-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~31#1; [2025-02-05 15:50:04,022 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2203: #res := ~retValue_acc~35; [2025-02-05 15:50:04,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1887: #res := ~retValue_acc~30; [2025-02-05 15:50:04,046 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L205-1: createEmail_#res#1 := createEmail_~retValue_acc~3#1; [2025-02-05 15:50:04,058 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1431: #res := ~retValue_acc~24; [2025-02-05 15:50:04,077 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089: #res := ~retValue_acc~15; [2025-02-05 15:50:04,111 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1126: #res := ~retValue_acc~16; [2025-02-05 15:50:04,116 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1200: #res := ~retValue_acc~18; [2025-02-05 15:50:04,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L974: #res := ~retValue_acc~12; [2025-02-05 15:50:04,190 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1757: #res := ~retValue_acc~28; [2025-02-05 15:50:04,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1840-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~29#1; [2025-02-05 15:50:04,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2322-1: getClientId_#res#1 := getClientId_~retValue_acc~37#1; [2025-02-05 15:50:04,512 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~7#1; [2025-02-05 15:50:04,513 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2042-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~33#1; [2025-02-05 15:50:04,513 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~6#1; [2025-02-05 15:50:04,513 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2380-1: valid_product_#res#1 := valid_product_~retValue_acc~39#1; [2025-02-05 15:50:04,513 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~5#1; [2025-02-05 15:50:04,513 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2149-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~34#1; [2025-02-05 15:50:04,517 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: #res := ~retValue_acc~11; [2025-02-05 15:50:04,523 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L161-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~0#1; [2025-02-05 15:50:04,524 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: #res#1 := ~retValue_acc~1#1; [2025-02-05 15:50:04,631 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2025-02-05 15:50:04,632 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:50:04,647 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:50:04,647 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:50:04,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:50:04 BoogieIcfgContainer [2025-02-05 15:50:04,647 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:50:04,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:50:04,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:50:04,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:50:04,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:50:02" (1/3) ... [2025-02-05 15:50:04,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cab01ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:50:04, skipping insertion in model container [2025-02-05 15:50:04,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:50:03" (2/3) ... [2025-02-05 15:50:04,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cab01ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:50:04, skipping insertion in model container [2025-02-05 15:50:04,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:50:04" (3/3) ... [2025-02-05 15:50:04,654 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_product32.cil.c [2025-02-05 15:50:04,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:50:04,666 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-02-05 15:50:04,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:50:04,732 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;@7286f776, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:50:04,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:50:04,738 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-02-05 15:50:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:50:04,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:04,751 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-02-05 15:50:04,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:04,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1852594478, now seen corresponding path program 1 times [2025-02-05 15:50:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:04,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083553878] [2025-02-05 15:50:04,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:04,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:50:04,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:50:04,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:04,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:50:05,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:05,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083553878] [2025-02-05 15:50:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083553878] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:50:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669581551] [2025-02-05 15:50:05,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:05,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:50:05,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:50:05,328 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-02-05 15:50:05,329 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-02-05 15:50:05,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:50:05,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:50:05,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:05,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:05,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:50:05,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:50:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:50:05,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:50:05,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669581551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:05,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:50:05,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:50:05,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349159312] [2025-02-05 15:50:05,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:05,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:50:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:05,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:50:05,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:50:05,666 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 2 states, 2 states have (on average 32.0) internal successors, (64), 2 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-02-05 15:50:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:05,709 INFO L93 Difference]: Finished difference Result 658 states and 974 transitions. [2025-02-05 15:50:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:50:05,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 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-02-05 15:50:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:05,725 INFO L225 Difference]: With dead ends: 658 [2025-02-05 15:50:05,725 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 15:50:05,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 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-02-05 15:50:05,736 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:50:05,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 15:50:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-02-05 15:50:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 324 states have (on average 1.5462962962962963) internal successors, (501), 328 states have internal predecessors, (501), 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-02-05 15:50:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 630 transitions. [2025-02-05 15:50:05,797 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 630 transitions. Word has length 110 [2025-02-05 15:50:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:05,798 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 630 transitions. [2025-02-05 15:50:05,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 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-02-05 15:50:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 630 transitions. [2025-02-05 15:50:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:50:05,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:05,807 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] [2025-02-05 15:50:05,816 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-02-05 15:50:06,009 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-02-05 15:50:06,009 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:06,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1428820767, now seen corresponding path program 1 times [2025-02-05 15:50:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:06,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823703469] [2025-02-05 15:50:06,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:06,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:50:06,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:50:06,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:06,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:50:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823703469] [2025-02-05 15:50:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823703469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:50:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566978389] [2025-02-05 15:50:06,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:06,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:50:06,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:50:06,270 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-02-05 15:50:06,272 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-02-05 15:50:06,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:50:06,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:50:06,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:06,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:06,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:50:06,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:50:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:50:06,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:50:06,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566978389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:06,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:50:06,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:50:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677924714] [2025-02-05 15:50:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:06,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:06,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:06,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:50:06,544 INFO L87 Difference]: Start difference. First operand 418 states and 630 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-05 15:50:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:06,573 INFO L93 Difference]: Finished difference Result 647 states and 952 transitions. [2025-02-05 15:50:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:06,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 111 [2025-02-05 15:50:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:06,577 INFO L225 Difference]: With dead ends: 647 [2025-02-05 15:50:06,577 INFO L226 Difference]: Without dead ends: 420 [2025-02-05 15:50:06,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 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-02-05 15:50:06,580 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 0 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:50:06,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1256 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-05 15:50:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-02-05 15:50:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 326 states have (on average 1.5429447852760736) internal successors, (503), 330 states have internal predecessors, (503), 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-02-05 15:50:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 632 transitions. [2025-02-05 15:50:06,598 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 632 transitions. Word has length 111 [2025-02-05 15:50:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:06,599 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 632 transitions. [2025-02-05 15:50:06,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-05 15:50:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 632 transitions. [2025-02-05 15:50:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:50:06,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:06,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:50:06,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:50:06,802 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-02-05 15:50:06,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:06,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash -205574611, now seen corresponding path program 1 times [2025-02-05 15:50:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:06,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796395351] [2025-02-05 15:50:06,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:06,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:50:06,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:50:06,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:06,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:50:07,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796395351] [2025-02-05 15:50:07,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796395351] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:50:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068131071] [2025-02-05 15:50:07,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:07,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:50:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:50:07,016 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-02-05 15:50:07,018 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-02-05 15:50:07,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:50:07,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:50:07,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:07,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:07,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:50:07,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:50:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:50:07,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:50:07,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068131071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:07,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:50:07,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:50:07,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270205126] [2025-02-05 15:50:07,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:07,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:07,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:07,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:07,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:50:07,352 INFO L87 Difference]: Start difference. First operand 420 states and 632 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-05 15:50:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:07,402 INFO L93 Difference]: Finished difference Result 887 states and 1355 transitions. [2025-02-05 15:50:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 119 [2025-02-05 15:50:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:07,406 INFO L225 Difference]: With dead ends: 887 [2025-02-05 15:50:07,408 INFO L226 Difference]: Without dead ends: 494 [2025-02-05 15:50:07,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 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-02-05 15:50:07,410 INFO L435 NwaCegarLoop]: 650 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, 1234 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-02-05 15:50:07,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1234 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-02-05 15:50:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 486. [2025-02-05 15:50:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 378 states have (on average 1.5634920634920635) internal successors, (591), 382 states have internal predecessors, (591), 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-02-05 15:50:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 748 transitions. [2025-02-05 15:50:07,440 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 748 transitions. Word has length 119 [2025-02-05 15:50:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:07,440 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 748 transitions. [2025-02-05 15:50:07,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-05 15:50:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 748 transitions. [2025-02-05 15:50:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:50:07,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:07,443 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:50:07,451 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-02-05 15:50:07,647 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-02-05 15:50:07,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:07,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1952576022, now seen corresponding path program 1 times [2025-02-05 15:50:07,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:07,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082258870] [2025-02-05 15:50:07,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:07,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:50:07,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:50:07,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:07,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:50:07,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:07,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082258870] [2025-02-05 15:50:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082258870] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:50:07,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034919929] [2025-02-05 15:50:07,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:07,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:50:07,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:50:07,828 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-02-05 15:50:07,830 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-02-05 15:50:07,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:50:08,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:50:08,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:08,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:08,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:50:08,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:50:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:50:08,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:50:08,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034919929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:08,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:50:08,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:50:08,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489307012] [2025-02-05 15:50:08,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:08,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:50:08,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:08,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:50:08,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:50:08,114 INFO L87 Difference]: Start difference. First operand 486 states and 748 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-02-05 15:50:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:08,170 INFO L93 Difference]: Finished difference Result 963 states and 1486 transitions. [2025-02-05 15:50:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:50:08,171 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 120 [2025-02-05 15:50:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:08,174 INFO L225 Difference]: With dead ends: 963 [2025-02-05 15:50:08,174 INFO L226 Difference]: Without dead ends: 488 [2025-02-05 15:50:08,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 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-02-05 15:50:08,177 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-02-05 15:50:08,178 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-02-05 15:50:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-02-05 15:50:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-02-05 15:50:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 379 states have (on average 1.562005277044855) internal successors, (592), 384 states have internal predecessors, (592), 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-02-05 15:50:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 751 transitions. [2025-02-05 15:50:08,201 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 751 transitions. Word has length 120 [2025-02-05 15:50:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:08,202 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 751 transitions. [2025-02-05 15:50:08,202 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-02-05 15:50:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 751 transitions. [2025-02-05 15:50:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:50:08,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:08,205 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:08,214 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-02-05 15:50:08,406 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-02-05 15:50:08,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:08,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:08,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1419164115, now seen corresponding path program 1 times [2025-02-05 15:50:08,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:08,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390163907] [2025-02-05 15:50:08,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:08,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:50:08,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:50:08,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:50:08,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:08,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390163907] [2025-02-05 15:50:08,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390163907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:50:08,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818306548] [2025-02-05 15:50:08,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:08,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:50:08,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:50:08,559 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-02-05 15:50:08,560 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-02-05 15:50:08,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:50:08,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:50:08,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:08,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:08,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:50:08,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:50:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:50:08,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:50:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818306548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:50:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:50:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532777264] [2025-02-05 15:50:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:08,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:50:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:08,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:50:08,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:50:08,838 INFO L87 Difference]: Start difference. First operand 488 states and 751 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-02-05 15:50:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:08,898 INFO L93 Difference]: Finished difference Result 965 states and 1491 transitions. [2025-02-05 15:50:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:50:08,898 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 121 [2025-02-05 15:50:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:08,901 INFO L225 Difference]: With dead ends: 965 [2025-02-05 15:50:08,901 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:50:08,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:50:08,903 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-02-05 15:50:08,903 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-02-05 15:50:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:50:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-02-05 15:50:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 380 states have (on average 1.5605263157894738) internal successors, (593), 386 states have internal predecessors, (593), 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-02-05 15:50:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 757 transitions. [2025-02-05 15:50:08,918 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 757 transitions. Word has length 121 [2025-02-05 15:50:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:08,918 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 757 transitions. [2025-02-05 15:50:08,918 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-02-05 15:50:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 757 transitions. [2025-02-05 15:50:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:50:08,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:08,920 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-02-05 15:50:08,929 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-02-05 15:50:09,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:50:09,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:09,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash 655460027, now seen corresponding path program 1 times [2025-02-05 15:50:09,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:09,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514807646] [2025-02-05 15:50:09,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:09,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:09,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:50:09,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:50:09,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:50:09,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:09,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514807646] [2025-02-05 15:50:09,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514807646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:09,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:09,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:50:09,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36656664] [2025-02-05 15:50:09,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:09,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:50:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:09,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:50:09,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:50:09,247 INFO L87 Difference]: Start difference. First operand 490 states and 757 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-02-05 15:50:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:09,282 INFO L93 Difference]: Finished difference Result 957 states and 1482 transitions. [2025-02-05 15:50:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:50:09,282 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 122 [2025-02-05 15:50:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:09,285 INFO L225 Difference]: With dead ends: 957 [2025-02-05 15:50:09,285 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:50:09,287 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-02-05 15:50:09,287 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-02-05 15:50:09,287 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-02-05 15:50:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:50:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-02-05 15:50:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 380 states have (on average 1.5605263157894738) internal successors, (593), 386 states have internal predecessors, (593), 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-02-05 15:50:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 756 transitions. [2025-02-05 15:50:09,310 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 756 transitions. Word has length 122 [2025-02-05 15:50:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:09,311 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 756 transitions. [2025-02-05 15:50:09,311 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-02-05 15:50:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 756 transitions. [2025-02-05 15:50:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:50:09,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:09,313 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-02-05 15:50:09,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:50:09,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:09,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1710700074, now seen corresponding path program 2 times [2025-02-05 15:50:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:09,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398140154] [2025-02-05 15:50:09,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:50:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:09,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-02-05 15:50:09,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:50:09,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:50:09,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:50:09,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:09,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398140154] [2025-02-05 15:50:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398140154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:09,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:09,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:50:09,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599330427] [2025-02-05 15:50:09,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:09,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:50:09,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:09,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:50:09,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:50:09,445 INFO L87 Difference]: Start difference. First operand 490 states and 756 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-02-05 15:50:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:09,495 INFO L93 Difference]: Finished difference Result 955 states and 1477 transitions. [2025-02-05 15:50:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:50:09,496 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 123 [2025-02-05 15:50:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:09,501 INFO L225 Difference]: With dead ends: 955 [2025-02-05 15:50:09,501 INFO L226 Difference]: Without dead ends: 490 [2025-02-05 15:50:09,503 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-02-05 15:50:09,503 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-02-05 15:50:09,503 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-02-05 15:50:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-02-05 15:50:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-02-05 15:50:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 380 states have (on average 1.5605263157894738) internal successors, (593), 386 states have internal predecessors, (593), 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-02-05 15:50:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 755 transitions. [2025-02-05 15:50:09,526 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 755 transitions. Word has length 123 [2025-02-05 15:50:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:09,526 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 755 transitions. [2025-02-05 15:50:09,527 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-02-05 15:50:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 755 transitions. [2025-02-05 15:50:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:50:09,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:09,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:09,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:50:09,529 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:09,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash 703574236, now seen corresponding path program 3 times [2025-02-05 15:50:09,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:09,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007859892] [2025-02-05 15:50:09,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:50:09,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:09,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 124 statements into 3 equivalence classes. [2025-02-05 15:50:09,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 112 of 124 statements. [2025-02-05 15:50:09,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:50:09,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:50:09,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:09,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007859892] [2025-02-05 15:50:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007859892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:09,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:09,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:50:09,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447425301] [2025-02-05 15:50:09,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:09,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:50:09,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:09,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:50:09,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:50:09,652 INFO L87 Difference]: Start difference. First operand 490 states and 755 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-02-05 15:50:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:09,699 INFO L93 Difference]: Finished difference Result 957 states and 1483 transitions. [2025-02-05 15:50:09,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:50:09,699 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 124 [2025-02-05 15:50:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:09,702 INFO L225 Difference]: With dead ends: 957 [2025-02-05 15:50:09,702 INFO L226 Difference]: Without dead ends: 492 [2025-02-05 15:50:09,704 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-02-05 15:50:09,704 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-02-05 15:50:09,705 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-02-05 15:50:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-02-05 15:50:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-02-05 15:50:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 381 states have (on average 1.5590551181102361) internal successors, (594), 388 states have internal predecessors, (594), 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-02-05 15:50:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 761 transitions. [2025-02-05 15:50:09,724 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 761 transitions. Word has length 124 [2025-02-05 15:50:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:09,724 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 761 transitions. [2025-02-05 15:50:09,725 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-02-05 15:50:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 761 transitions. [2025-02-05 15:50:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:50:09,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:09,727 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:09,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:50:09,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:09,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:09,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1990156595, now seen corresponding path program 1 times [2025-02-05 15:50:09,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:09,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464833202] [2025-02-05 15:50:09,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:09,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:09,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:50:09,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:50:09,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:09,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:50:09,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:09,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464833202] [2025-02-05 15:50:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464833202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:09,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:09,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:50:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120759027] [2025-02-05 15:50:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:09,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:50:09,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:09,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:50:09,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:50:09,847 INFO L87 Difference]: Start difference. First operand 492 states and 761 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-02-05 15:50:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:09,886 INFO L93 Difference]: Finished difference Result 963 states and 1493 transitions. [2025-02-05 15:50:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:50:09,887 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 125 [2025-02-05 15:50:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:09,890 INFO L225 Difference]: With dead ends: 963 [2025-02-05 15:50:09,890 INFO L226 Difference]: Without dead ends: 494 [2025-02-05 15:50:09,891 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-02-05 15:50:09,892 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-02-05 15:50:09,892 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-02-05 15:50:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-02-05 15:50:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-02-05 15:50:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 382 states have (on average 1.557591623036649) internal successors, (595), 390 states have internal predecessors, (595), 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-02-05 15:50:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 764 transitions. [2025-02-05 15:50:09,907 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 764 transitions. Word has length 125 [2025-02-05 15:50:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:09,907 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 764 transitions. [2025-02-05 15:50:09,908 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-02-05 15:50:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 764 transitions. [2025-02-05 15:50:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:50:09,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:09,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:09,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:50:09,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:09,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -698004011, now seen corresponding path program 1 times [2025-02-05 15:50:09,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:09,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842575953] [2025-02-05 15:50:09,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:09,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:50:09,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:50:09,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:09,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:50:10,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:10,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842575953] [2025-02-05 15:50:10,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842575953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:50:10,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900360018] [2025-02-05 15:50:10,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:10,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:50:10,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:50:10,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:50:10,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:50:10,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:50:10,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:50:10,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:10,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:10,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:50:10,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:50:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:10,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:50:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900360018] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:50:10,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:50:10,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:50:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049764164] [2025-02-05 15:50:10,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:50:10,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:50:10,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:10,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:50:10,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:50:10,406 INFO L87 Difference]: Start difference. First operand 494 states and 764 transitions. Second operand has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 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-02-05 15:50:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:10,973 INFO L93 Difference]: Finished difference Result 1398 states and 2258 transitions. [2025-02-05 15:50:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:50:10,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 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 126 [2025-02-05 15:50:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:10,979 INFO L225 Difference]: With dead ends: 1398 [2025-02-05 15:50:10,979 INFO L226 Difference]: Without dead ends: 933 [2025-02-05 15:50:10,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:50:10,983 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 1416 mSDsluCounter, 3846 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 4465 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:50:10,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 4465 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:50:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-05 15:50:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 909. [2025-02-05 15:50:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 718 states have (on average 1.6128133704735377) internal successors, (1158), 725 states have internal predecessors, (1158), 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-02-05 15:50:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1495 transitions. [2025-02-05 15:50:11,019 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1495 transitions. Word has length 126 [2025-02-05 15:50:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:11,019 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1495 transitions. [2025-02-05 15:50:11,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 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-02-05 15:50:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1495 transitions. [2025-02-05 15:50:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:50:11,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:11,024 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-02-05 15:50:11,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:50:11,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:50:11,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:11,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1874973701, now seen corresponding path program 1 times [2025-02-05 15:50:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744982620] [2025-02-05 15:50:11,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:11,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:50:11,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:50:11,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:11,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:11,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:11,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744982620] [2025-02-05 15:50:11,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744982620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:11,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:11,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922948233] [2025-02-05 15:50:11,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:11,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:11,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:11,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:11,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:11,298 INFO L87 Difference]: Start difference. First operand 909 states and 1495 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-02-05 15:50:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:11,333 INFO L93 Difference]: Finished difference Result 2133 states and 3568 transitions. [2025-02-05 15:50:11,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:11,334 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-02-05 15:50:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:11,340 INFO L225 Difference]: With dead ends: 2133 [2025-02-05 15:50:11,340 INFO L226 Difference]: Without dead ends: 1302 [2025-02-05 15:50:11,343 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-02-05 15:50:11,343 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 131 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1259 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-02-05 15:50:11,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-02-05 15:50:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1294. [2025-02-05 15:50:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1024 states have (on average 1.6337890625) internal successors, (1673), 1031 states have internal predecessors, (1673), 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-02-05 15:50:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2178 transitions. [2025-02-05 15:50:11,388 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2178 transitions. Word has length 129 [2025-02-05 15:50:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:11,389 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 2178 transitions. [2025-02-05 15:50:11,389 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-02-05 15:50:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2178 transitions. [2025-02-05 15:50:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:50:11,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:11,395 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-02-05 15:50:11,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:50:11,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:11,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:11,395 INFO L85 PathProgramCache]: Analyzing trace with hash 425680451, now seen corresponding path program 1 times [2025-02-05 15:50:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:11,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759135174] [2025-02-05 15:50:11,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:11,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:50:11,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:50:11,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:11,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:11,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:11,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759135174] [2025-02-05 15:50:11,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759135174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:11,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:11,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195289511] [2025-02-05 15:50:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:11,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:11,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:11,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:11,443 INFO L87 Difference]: Start difference. First operand 1294 states and 2178 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-02-05 15:50:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:11,490 INFO L93 Difference]: Finished difference Result 3096 states and 5250 transitions. [2025-02-05 15:50:11,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:11,490 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-02-05 15:50:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:11,500 INFO L225 Difference]: With dead ends: 3096 [2025-02-05 15:50:11,500 INFO L226 Difference]: Without dead ends: 1931 [2025-02-05 15:50:11,503 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-02-05 15:50:11,504 INFO L435 NwaCegarLoop]: 632 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, 1254 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-02-05 15:50:11,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1254 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2025-02-05 15:50:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1923. [2025-02-05 15:50:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1534 states have (on average 1.6447196870925684) internal successors, (2523), 1541 states have internal predecessors, (2523), 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-02-05 15:50:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 3266 transitions. [2025-02-05 15:50:11,613 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 3266 transitions. Word has length 130 [2025-02-05 15:50:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:11,614 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 3266 transitions. [2025-02-05 15:50:11,614 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-02-05 15:50:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 3266 transitions. [2025-02-05 15:50:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:50:11,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:11,624 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-02-05 15:50:11,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:50:11,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:11,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2080173766, now seen corresponding path program 1 times [2025-02-05 15:50:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:11,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078105360] [2025-02-05 15:50:11,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:11,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:50:11,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:50:11,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:11,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:11,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:11,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078105360] [2025-02-05 15:50:11,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078105360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:11,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:11,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:11,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314032517] [2025-02-05 15:50:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:11,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:11,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:11,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:11,681 INFO L87 Difference]: Start difference. First operand 1923 states and 3266 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-02-05 15:50:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:11,764 INFO L93 Difference]: Finished difference Result 4558 states and 7809 transitions. [2025-02-05 15:50:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:11,765 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-02-05 15:50:11,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:11,779 INFO L225 Difference]: With dead ends: 4558 [2025-02-05 15:50:11,780 INFO L226 Difference]: Without dead ends: 2896 [2025-02-05 15:50:11,786 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-02-05 15:50:11,786 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-02-05 15:50:11,786 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-02-05 15:50:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2025-02-05 15:50:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2888. [2025-02-05 15:50:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2337 states have (on average 1.6534017971758665) internal successors, (3864), 2344 states have internal predecessors, (3864), 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-02-05 15:50:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4947 transitions. [2025-02-05 15:50:11,930 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4947 transitions. Word has length 131 [2025-02-05 15:50:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:11,930 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4947 transitions. [2025-02-05 15:50:11,930 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-02-05 15:50:11,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4947 transitions. [2025-02-05 15:50:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:50:11,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:11,943 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-02-05 15:50:11,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:50:11,943 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:11,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:11,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1928403292, now seen corresponding path program 1 times [2025-02-05 15:50:11,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:11,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405791741] [2025-02-05 15:50:11,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:11,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:11,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:50:11,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:50:11,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:11,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:11,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:11,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405791741] [2025-02-05 15:50:11,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405791741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:11,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:11,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219938777] [2025-02-05 15:50:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:12,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:12,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:12,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:12,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:12,000 INFO L87 Difference]: Start difference. First operand 2888 states and 4947 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-02-05 15:50:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:12,101 INFO L93 Difference]: Finished difference Result 6866 states and 11856 transitions. [2025-02-05 15:50:12,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:12,101 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-02-05 15:50:12,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:12,125 INFO L225 Difference]: With dead ends: 6866 [2025-02-05 15:50:12,126 INFO L226 Difference]: Without dead ends: 4454 [2025-02-05 15:50:12,135 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-02-05 15:50:12,136 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-02-05 15:50:12,136 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-02-05 15:50:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-02-05 15:50:12,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4446. [2025-02-05 15:50:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4446 states, 3650 states have (on average 1.6597260273972603) internal successors, (6058), 3657 states have internal predecessors, (6058), 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-02-05 15:50:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4446 states to 4446 states and 7657 transitions. [2025-02-05 15:50:12,365 INFO L78 Accepts]: Start accepts. Automaton has 4446 states and 7657 transitions. Word has length 132 [2025-02-05 15:50:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:12,365 INFO L471 AbstractCegarLoop]: Abstraction has 4446 states and 7657 transitions. [2025-02-05 15:50:12,365 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-02-05 15:50:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4446 states and 7657 transitions. [2025-02-05 15:50:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:50:12,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:12,382 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-02-05 15:50:12,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:50:12,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:12,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1599080551, now seen corresponding path program 1 times [2025-02-05 15:50:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682652876] [2025-02-05 15:50:12,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:12,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:50:12,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:50:12,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:12,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:12,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:12,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682652876] [2025-02-05 15:50:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682652876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913786351] [2025-02-05 15:50:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:12,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:12,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:12,428 INFO L87 Difference]: Start difference. First operand 4446 states and 7657 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-02-05 15:50:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:12,614 INFO L93 Difference]: Finished difference Result 10981 states and 19029 transitions. [2025-02-05 15:50:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:12,614 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-02-05 15:50:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:12,655 INFO L225 Difference]: With dead ends: 10981 [2025-02-05 15:50:12,655 INFO L226 Difference]: Without dead ends: 7258 [2025-02-05 15:50:12,667 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-02-05 15:50:12,667 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-02-05 15:50:12,667 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-02-05 15:50:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2025-02-05 15:50:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 7250. [2025-02-05 15:50:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7250 states, 5961 states have (on average 1.65710451266566) internal successors, (9878), 5968 states have internal predecessors, (9878), 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-02-05 15:50:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7250 states to 7250 states and 12507 transitions. [2025-02-05 15:50:12,977 INFO L78 Accepts]: Start accepts. Automaton has 7250 states and 12507 transitions. Word has length 133 [2025-02-05 15:50:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:12,977 INFO L471 AbstractCegarLoop]: Abstraction has 7250 states and 12507 transitions. [2025-02-05 15:50:12,977 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-02-05 15:50:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 7250 states and 12507 transitions. [2025-02-05 15:50:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:50:13,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:13,004 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-02-05 15:50:13,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:50:13,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:13,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash -391702971, now seen corresponding path program 1 times [2025-02-05 15:50:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:13,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694413809] [2025-02-05 15:50:13,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:13,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:50:13,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:50:13,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:13,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:13,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694413809] [2025-02-05 15:50:13,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694413809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:13,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225700031] [2025-02-05 15:50:13,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:13,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:13,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:13,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:13,079 INFO L87 Difference]: Start difference. First operand 7250 states and 12507 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-02-05 15:50:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:13,422 INFO L93 Difference]: Finished difference Result 18296 states and 31777 transitions. [2025-02-05 15:50:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:13,426 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-02-05 15:50:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:13,490 INFO L225 Difference]: With dead ends: 18296 [2025-02-05 15:50:13,490 INFO L226 Difference]: Without dead ends: 12165 [2025-02-05 15:50:13,519 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-02-05 15:50:13,519 INFO L435 NwaCegarLoop]: 637 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, 1260 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-02-05 15:50:13,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1260 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2025-02-05 15:50:13,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 12157. [2025-02-05 15:50:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12157 states, 10046 states have (on average 1.6580728648218197) internal successors, (16657), 10053 states have internal predecessors, (16657), 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-02-05 15:50:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12157 states to 12157 states and 21008 transitions. [2025-02-05 15:50:13,974 INFO L78 Accepts]: Start accepts. Automaton has 12157 states and 21008 transitions. Word has length 134 [2025-02-05 15:50:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:13,974 INFO L471 AbstractCegarLoop]: Abstraction has 12157 states and 21008 transitions. [2025-02-05 15:50:13,975 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-02-05 15:50:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 12157 states and 21008 transitions. [2025-02-05 15:50:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:50:14,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:14,006 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-02-05 15:50:14,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:50:14,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:14,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:14,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1401507224, now seen corresponding path program 1 times [2025-02-05 15:50:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:14,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733277331] [2025-02-05 15:50:14,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:14,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:14,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:50:14,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:50:14,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:14,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:14,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:14,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733277331] [2025-02-05 15:50:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733277331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159399782] [2025-02-05 15:50:14,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:14,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:14,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:14,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:14,057 INFO L87 Difference]: Start difference. First operand 12157 states and 21008 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-02-05 15:50:14,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:14,448 INFO L93 Difference]: Finished difference Result 29052 states and 50154 transitions. [2025-02-05 15:50:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:14,449 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-02-05 15:50:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:14,584 INFO L225 Difference]: With dead ends: 29052 [2025-02-05 15:50:14,584 INFO L226 Difference]: Without dead ends: 18981 [2025-02-05 15:50:14,609 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-02-05 15:50:14,610 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 119 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1224 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-02-05 15:50:14,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1224 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18981 states. [2025-02-05 15:50:15,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18981 to 18973. [2025-02-05 15:50:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18973 states, 15659 states have (on average 1.6342039721565873) internal successors, (25590), 15666 states have internal predecessors, (25590), 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-02-05 15:50:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18973 states to 18973 states and 32491 transitions. [2025-02-05 15:50:15,364 INFO L78 Accepts]: Start accepts. Automaton has 18973 states and 32491 transitions. Word has length 135 [2025-02-05 15:50:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:15,364 INFO L471 AbstractCegarLoop]: Abstraction has 18973 states and 32491 transitions. [2025-02-05 15:50:15,364 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-02-05 15:50:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 18973 states and 32491 transitions. [2025-02-05 15:50:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:50:15,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:15,399 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-02-05 15:50:15,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:50:15,400 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:15,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1742564698, now seen corresponding path program 1 times [2025-02-05 15:50:15,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871626098] [2025-02-05 15:50:15,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:15,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:50:15,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:50:15,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:15,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871626098] [2025-02-05 15:50:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871626098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:15,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:15,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146353672] [2025-02-05 15:50:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:15,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:15,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:15,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:15,463 INFO L87 Difference]: Start difference. First operand 18973 states and 32491 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-02-05 15:50:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:16,326 INFO L93 Difference]: Finished difference Result 50089 states and 86137 transitions. [2025-02-05 15:50:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:16,326 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-02-05 15:50:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:16,457 INFO L225 Difference]: With dead ends: 50089 [2025-02-05 15:50:16,457 INFO L226 Difference]: Without dead ends: 33836 [2025-02-05 15:50:16,501 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-02-05 15:50:16,501 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-02-05 15:50:16,502 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-02-05 15:50:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33836 states. [2025-02-05 15:50:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33836 to 33828. [2025-02-05 15:50:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33828 states, 28064 states have (on average 1.631627708095781) internal successors, (45790), 28071 states have internal predecessors, (45790), 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-02-05 15:50:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33828 states to 33828 states and 57865 transitions. [2025-02-05 15:50:17,602 INFO L78 Accepts]: Start accepts. Automaton has 33828 states and 57865 transitions. Word has length 136 [2025-02-05 15:50:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:17,603 INFO L471 AbstractCegarLoop]: Abstraction has 33828 states and 57865 transitions. [2025-02-05 15:50:17,603 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-02-05 15:50:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33828 states and 57865 transitions. [2025-02-05 15:50:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:50:17,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:17,647 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-02-05 15:50:17,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:50:17,647 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:17,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash -919516489, now seen corresponding path program 1 times [2025-02-05 15:50:17,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:17,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591238027] [2025-02-05 15:50:17,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:17,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:50:17,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:50:17,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:17,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:17,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591238027] [2025-02-05 15:50:17,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591238027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:17,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:17,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:17,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238947345] [2025-02-05 15:50:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:17,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:17,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:17,720 INFO L87 Difference]: Start difference. First operand 33828 states and 57865 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-02-05 15:50:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:18,983 INFO L93 Difference]: Finished difference Result 92181 states and 158224 transitions. [2025-02-05 15:50:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:18,984 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-02-05 15:50:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:19,267 INFO L225 Difference]: With dead ends: 92181 [2025-02-05 15:50:19,268 INFO L226 Difference]: Without dead ends: 61980 [2025-02-05 15:50:19,360 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-02-05 15:50:19,360 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 115 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1251 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-02-05 15:50:19,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1251 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61980 states. [2025-02-05 15:50:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61980 to 61972. [2025-02-05 15:50:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61972 states, 51695 states have (on average 1.627855692039849) internal successors, (84152), 51702 states have internal predecessors, (84152), 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-02-05 15:50:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61972 states to 61972 states and 105785 transitions. [2025-02-05 15:50:21,647 INFO L78 Accepts]: Start accepts. Automaton has 61972 states and 105785 transitions. Word has length 137 [2025-02-05 15:50:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:21,648 INFO L471 AbstractCegarLoop]: Abstraction has 61972 states and 105785 transitions. [2025-02-05 15:50:21,648 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-02-05 15:50:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 61972 states and 105785 transitions. [2025-02-05 15:50:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:50:21,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:21,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, 1, 1, 1, 1, 1, 1] [2025-02-05 15:50:21,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:50:21,687 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:21,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash -283074649, now seen corresponding path program 1 times [2025-02-05 15:50:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:21,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634449840] [2025-02-05 15:50:21,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:21,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:50:21,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:50:21,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:21,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:21,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634449840] [2025-02-05 15:50:21,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634449840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:21,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:21,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:50:21,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873504338] [2025-02-05 15:50:21,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:21,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:50:21,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:21,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:50:21,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:50:21,739 INFO L87 Difference]: Start difference. First operand 61972 states and 105785 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-02-05 15:50:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:23,796 INFO L93 Difference]: Finished difference Result 116047 states and 198522 transitions. [2025-02-05 15:50:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:50:23,797 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-02-05 15:50:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:24,304 INFO L225 Difference]: With dead ends: 116047 [2025-02-05 15:50:24,304 INFO L226 Difference]: Without dead ends: 115820 [2025-02-05 15:50:24,359 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-02-05 15:50:24,362 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 110 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1256 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-02-05 15:50:24,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1256 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:50:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115820 states. [2025-02-05 15:50:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115820 to 115812. [2025-02-05 15:50:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115812 states, 97167 states have (on average 1.6228452046476685) internal successors, (157687), 97174 states have internal predecessors, (157687), 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-02-05 15:50:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115812 states to 115812 states and 197102 transitions. [2025-02-05 15:50:28,096 INFO L78 Accepts]: Start accepts. Automaton has 115812 states and 197102 transitions. Word has length 138 [2025-02-05 15:50:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:50:28,096 INFO L471 AbstractCegarLoop]: Abstraction has 115812 states and 197102 transitions. [2025-02-05 15:50:28,097 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-02-05 15:50:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 115812 states and 197102 transitions. [2025-02-05 15:50:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:50:28,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:50:28,146 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-02-05 15:50:28,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:50:28,146 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:50:28,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:50:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1229494378, now seen corresponding path program 1 times [2025-02-05 15:50:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:50:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248897103] [2025-02-05 15:50:28,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:50:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:50:28,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:50:28,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:50:28,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:50:28,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:50:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:50:28,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:50:28,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248897103] [2025-02-05 15:50:28,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248897103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:50:28,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:50:28,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:50:28,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915441527] [2025-02-05 15:50:28,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:50:28,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:50:28,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:50:28,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:50:28,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:50:28,408 INFO L87 Difference]: Start difference. First operand 115812 states and 197102 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-02-05 15:50:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:50:34,433 INFO L93 Difference]: Finished difference Result 230933 states and 398458 transitions. [2025-02-05 15:50:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 15:50:34,434 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-02-05 15:50:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:50:35,351 INFO L225 Difference]: With dead ends: 230933 [2025-02-05 15:50:35,352 INFO L226 Difference]: Without dead ends: 230712 [2025-02-05 15:50:35,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-02-05 15:50:35,441 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 1822 mSDsluCounter, 7670 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 8400 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:50:35,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 8400 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:50:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230712 states.