./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_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 67a5f870249755b02192cafa5b1141561e5c0ebfbfae7faed4cfc72be0ad5c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:55:40,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:55:41,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:55:41,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:55:41,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:55:41,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:55:41,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:55:41,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:55:41,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:55:41,064 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:55:41,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:55:41,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:55:41,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:55:41,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:55:41,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:55:41,065 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:55:41,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:55:41,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:55:41,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:55:41,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:41,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:55:41,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:55:41,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:55:41,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:41,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:55:41,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:55:41,069 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 -> 67a5f870249755b02192cafa5b1141561e5c0ebfbfae7faed4cfc72be0ad5c3d [2025-01-09 03:55:41,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:55:41,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:55:41,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:55:41,286 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:55:41,286 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:55:41,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product32.cil.c [2025-01-09 03:55:42,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a840ff240/c6064c9ae9264405a0308ec22834fed6/FLAG37fc6fcb6 [2025-01-09 03:55:42,823 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:55:42,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product32.cil.c [2025-01-09 03:55:42,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a840ff240/c6064c9ae9264405a0308ec22834fed6/FLAG37fc6fcb6 [2025-01-09 03:55:43,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a840ff240/c6064c9ae9264405a0308ec22834fed6 [2025-01-09 03:55:43,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:55:43,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:55:43,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:43,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:55:43,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:55:43,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3423d4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43, skipping insertion in model container [2025-01-09 03:55:43,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:55:43,428 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_spec6_product32.cil.c[40215,40228] [2025-01-09 03:55:43,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:43,585 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:55:43,593 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-01-09 03:55:43,594 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [277] [2025-01-09 03:55:43,594 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1357] [2025-01-09 03:55:43,594 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1769] [2025-01-09 03:55:43,595 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1778] [2025-01-09 03:55:43,595 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1796] [2025-01-09 03:55:43,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2162] [2025-01-09 03:55:43,596 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2586] [2025-01-09 03:55:43,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [2624] [2025-01-09 03:55:43,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2670] [2025-01-09 03:55:43,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2958] [2025-01-09 03:55:43,632 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_spec6_product32.cil.c[40215,40228] [2025-01-09 03:55:43,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:43,695 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:55:43,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43 WrapperNode [2025-01-09 03:55:43,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:43,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:43,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:55:43,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:55:43,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,771 INFO L138 Inliner]: procedures = 135, calls = 224, calls flagged for inlining = 62, calls inlined = 54, statements flattened = 1009 [2025-01-09 03:55:43,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:43,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:55:43,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:55:43,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:55:43,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,811 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:55:43,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:55:43,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:55:43,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:55:43,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:55:43,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (1/1) ... [2025-01-09 03:55:43,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:43,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:43,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:55:43,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:55:43,905 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:55:43,905 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:55:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:55:43,906 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:55:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:55:43,906 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:55:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:55:43,906 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:55:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:55:43,906 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:55:43,906 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:55:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:55:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:55:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:55:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:55:43,908 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:55:43,908 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:55:43,908 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:55:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:55:43,909 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:55:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:55:43,909 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:55:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:55:43,909 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:55:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:55:43,909 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:55:43,909 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:55:43,909 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:55:43,910 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:55:43,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:55:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:55:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:55:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:55:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:55:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:55:43,911 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:55:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:55:43,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:55:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:55:43,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:55:44,105 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:55:44,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:55:44,881 INFO L? ?]: Removed 541 outVars from TransFormulas that were not future-live. [2025-01-09 03:55:44,881 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:55:44,895 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:55:44,896 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:55:44,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:44 BoogieIcfgContainer [2025-01-09 03:55:44,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:55:44,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:55:44,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:55:44,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:55:44,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:55:43" (1/3) ... [2025-01-09 03:55:44,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4360863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:44, skipping insertion in model container [2025-01-09 03:55:44,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:43" (2/3) ... [2025-01-09 03:55:44,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4360863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:44, skipping insertion in model container [2025-01-09 03:55:44,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:44" (3/3) ... [2025-01-09 03:55:44,904 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product32.cil.c [2025-01-09 03:55:44,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:55:44,917 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product32.cil.c that has 29 procedures, 429 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:55:44,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:55:44,968 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;@6d5f34df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:55:44,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:55:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 429 states, 332 states have (on average 1.5451807228915662) internal successors, (513), 337 states have internal predecessors, (513), 67 states have call successors, (67), 28 states have call predecessors, (67), 28 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 03:55:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:55:44,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:44,990 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:44,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:44,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 641935374, now seen corresponding path program 1 times [2025-01-09 03:55:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:44,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297964732] [2025-01-09 03:55:44,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:45,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:55:45,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:55:45,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:45,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:55:45,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:45,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297964732] [2025-01-09 03:55:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297964732] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:45,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056971229] [2025-01-09 03:55:45,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:45,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:45,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:45,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:45,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:55:45,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:55:45,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:55:45,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:45,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:45,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:55:45,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:55:46,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056971229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:46,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:46,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:55:46,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554369177] [2025-01-09 03:55:46,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:46,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:46,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:46,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:46,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:46,031 INFO L87 Difference]: Start difference. First operand has 429 states, 332 states have (on average 1.5451807228915662) internal successors, (513), 337 states have internal predecessors, (513), 67 states have call successors, (67), 28 states have call predecessors, (67), 28 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:55:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:46,105 INFO L93 Difference]: Finished difference Result 668 states and 990 transitions. [2025-01-09 03:55:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:46,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2025-01-09 03:55:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:46,123 INFO L225 Difference]: With dead ends: 668 [2025-01-09 03:55:46,123 INFO L226 Difference]: Without dead ends: 424 [2025-01-09 03:55:46,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:46,130 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 1 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:46,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1281 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-01-09 03:55:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 423. [2025-01-09 03:55:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 327 states have (on average 1.5412844036697249) internal successors, (504), 331 states have internal predecessors, (504), 67 states have call successors, (67), 28 states have call predecessors, (67), 28 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 03:55:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 637 transitions. [2025-01-09 03:55:46,196 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 637 transitions. Word has length 154 [2025-01-09 03:55:46,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:46,197 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 637 transitions. [2025-01-09 03:55:46,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:55:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 637 transitions. [2025-01-09 03:55:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:55:46,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:46,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:46,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:46,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:55:46,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:46,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:46,409 INFO L85 PathProgramCache]: Analyzing trace with hash 378765985, now seen corresponding path program 1 times [2025-01-09 03:55:46,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:46,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527492715] [2025-01-09 03:55:46,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:46,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:46,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:55:46,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:55:46,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:46,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:55:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527492715] [2025-01-09 03:55:46,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527492715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297362642] [2025-01-09 03:55:46,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:46,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:46,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:55:46,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:55:47,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:55:47,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:47,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:47,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:47,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:55:47,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297362642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:55:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709988063] [2025-01-09 03:55:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:47,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:47,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:47,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:47,099 INFO L87 Difference]: Start difference. First operand 423 states and 637 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:55:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:47,144 INFO L93 Difference]: Finished difference Result 894 states and 1366 transitions. [2025-01-09 03:55:47,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:47,145 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 162 [2025-01-09 03:55:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:47,149 INFO L225 Difference]: With dead ends: 894 [2025-01-09 03:55:47,151 INFO L226 Difference]: Without dead ends: 497 [2025-01-09 03:55:47,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:47,155 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 134 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:47,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1233 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-09 03:55:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 489. [2025-01-09 03:55:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 379 states have (on average 1.562005277044855) internal successors, (592), 383 states have internal predecessors, (592), 81 states have call successors, (81), 28 states have call predecessors, (81), 28 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 03:55:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 753 transitions. [2025-01-09 03:55:47,188 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 753 transitions. Word has length 162 [2025-01-09 03:55:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:47,188 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 753 transitions. [2025-01-09 03:55:47,188 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:55:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 753 transitions. [2025-01-09 03:55:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 03:55:47,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:47,196 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:47,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:55:47,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:47,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:47,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1186335809, now seen corresponding path program 1 times [2025-01-09 03:55:47,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081245223] [2025-01-09 03:55:47,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:47,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:47,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:55:47,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:55:47,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:47,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:55:47,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081245223] [2025-01-09 03:55:47,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081245223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380798296] [2025-01-09 03:55:47,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:47,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:47,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:47,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:47,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:55:47,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:55:47,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:55:47,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:47,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:47,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:55:47,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:55:47,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:47,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380798296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:47,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:47,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:55:47,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068426219] [2025-01-09 03:55:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:47,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:47,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:47,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:47,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:47,950 INFO L87 Difference]: Start difference. First operand 489 states and 753 transitions. Second operand has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:47,999 INFO L93 Difference]: Finished difference Result 969 states and 1496 transitions. [2025-01-09 03:55:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:48,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 163 [2025-01-09 03:55:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:48,006 INFO L225 Difference]: With dead ends: 969 [2025-01-09 03:55:48,007 INFO L226 Difference]: Without dead ends: 491 [2025-01-09 03:55:48,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:48,010 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 2 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:48,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2501 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-01-09 03:55:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2025-01-09 03:55:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 380 states have (on average 1.5605263157894738) internal successors, (593), 385 states have internal predecessors, (593), 81 states have call successors, (81), 28 states have call predecessors, (81), 29 states have return successors, (82), 79 states have call predecessors, (82), 80 states have call successors, (82) [2025-01-09 03:55:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 756 transitions. [2025-01-09 03:55:48,033 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 756 transitions. Word has length 163 [2025-01-09 03:55:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:48,033 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 756 transitions. [2025-01-09 03:55:48,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 756 transitions. [2025-01-09 03:55:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 03:55:48,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:48,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:48,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:48,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:48,240 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1352020049, now seen corresponding path program 1 times [2025-01-09 03:55:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037792479] [2025-01-09 03:55:48,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:48,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:55:48,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:55:48,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:48,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 03:55:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:48,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037792479] [2025-01-09 03:55:48,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037792479] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:48,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520035830] [2025-01-09 03:55:48,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:48,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:48,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:48,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:48,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:55:48,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:55:48,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:55:48,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:48,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:55:48,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:55:48,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520035830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:48,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:48,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:55:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162291108] [2025-01-09 03:55:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:48,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:48,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:48,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:48,764 INFO L87 Difference]: Start difference. First operand 491 states and 756 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:48,825 INFO L93 Difference]: Finished difference Result 971 states and 1501 transitions. [2025-01-09 03:55:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:48,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 164 [2025-01-09 03:55:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:48,829 INFO L225 Difference]: With dead ends: 971 [2025-01-09 03:55:48,829 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 03:55:48,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 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-01-09 03:55:48,831 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 2 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:48,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2487 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 03:55:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-01-09 03:55:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 381 states have (on average 1.5590551181102361) internal successors, (594), 387 states have internal predecessors, (594), 81 states have call successors, (81), 28 states have call predecessors, (81), 30 states have return successors, (87), 79 states have call predecessors, (87), 80 states have call successors, (87) [2025-01-09 03:55:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 762 transitions. [2025-01-09 03:55:48,852 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 762 transitions. Word has length 164 [2025-01-09 03:55:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:48,852 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 762 transitions. [2025-01-09 03:55:48,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 762 transitions. [2025-01-09 03:55:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 03:55:48,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:48,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:48,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:49,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:49,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:49,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1704781504, now seen corresponding path program 1 times [2025-01-09 03:55:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:49,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034069456] [2025-01-09 03:55:49,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:49,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 03:55:49,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 03:55:49,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:49,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:55:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034069456] [2025-01-09 03:55:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034069456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:49,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282732655] [2025-01-09 03:55:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:49,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:49,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:49,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:49,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:49,252 INFO L87 Difference]: Start difference. First operand 493 states and 762 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:49,306 INFO L93 Difference]: Finished difference Result 963 states and 1492 transitions. [2025-01-09 03:55:49,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:49,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 165 [2025-01-09 03:55:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:49,312 INFO L225 Difference]: With dead ends: 963 [2025-01-09 03:55:49,313 INFO L226 Difference]: Without dead ends: 493 [2025-01-09 03:55:49,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:49,315 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 2 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:49,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2505 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-01-09 03:55:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-01-09 03:55:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 381 states have (on average 1.5590551181102361) internal successors, (594), 387 states have internal predecessors, (594), 81 states have call successors, (81), 28 states have call predecessors, (81), 30 states have return successors, (86), 79 states have call predecessors, (86), 80 states have call successors, (86) [2025-01-09 03:55:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 761 transitions. [2025-01-09 03:55:49,343 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 761 transitions. Word has length 165 [2025-01-09 03:55:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:49,344 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 761 transitions. [2025-01-09 03:55:49,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 761 transitions. [2025-01-09 03:55:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 03:55:49,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:49,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:49,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:55:49,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1695832381, now seen corresponding path program 1 times [2025-01-09 03:55:49,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:49,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205866089] [2025-01-09 03:55:49,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:49,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 03:55:49,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 03:55:49,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:49,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:55:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205866089] [2025-01-09 03:55:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205866089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:49,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:49,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238903488] [2025-01-09 03:55:49,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:49,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:49,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:49,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:49,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:49,476 INFO L87 Difference]: Start difference. First operand 493 states and 761 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:55:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:49,515 INFO L93 Difference]: Finished difference Result 965 states and 1495 transitions. [2025-01-09 03:55:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:49,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-01-09 03:55:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:49,518 INFO L225 Difference]: With dead ends: 965 [2025-01-09 03:55:49,518 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 03:55:49,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:49,520 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:49,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2508 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 03:55:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-01-09 03:55:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 382 states have (on average 1.557591623036649) internal successors, (595), 389 states have internal predecessors, (595), 81 states have call successors, (81), 28 states have call predecessors, (81), 31 states have return successors, (88), 79 states have call predecessors, (88), 80 states have call successors, (88) [2025-01-09 03:55:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 764 transitions. [2025-01-09 03:55:49,536 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 764 transitions. Word has length 147 [2025-01-09 03:55:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:49,536 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 764 transitions. [2025-01-09 03:55:49,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:55:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 764 transitions. [2025-01-09 03:55:49,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:55:49,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:49,538 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:49,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:55:49,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 995766789, now seen corresponding path program 1 times [2025-01-09 03:55:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:49,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553251514] [2025-01-09 03:55:49,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:49,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:55:49,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:55:49,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:49,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 03:55:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553251514] [2025-01-09 03:55:49,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553251514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:49,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:49,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:55:49,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624218941] [2025-01-09 03:55:49,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:49,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:49,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:49,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:49,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:49,715 INFO L87 Difference]: Start difference. First operand 495 states and 764 transitions. Second operand has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 8 states have internal predecessors, (103), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:55:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:49,830 INFO L93 Difference]: Finished difference Result 967 states and 1494 transitions. [2025-01-09 03:55:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:55:49,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 8 states have internal predecessors, (103), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 167 [2025-01-09 03:55:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:49,834 INFO L225 Difference]: With dead ends: 967 [2025-01-09 03:55:49,834 INFO L226 Difference]: Without dead ends: 497 [2025-01-09 03:55:49,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:55:49,836 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 7 mSDsluCounter, 3691 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4311 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:49,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4311 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:55:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-09 03:55:49,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-01-09 03:55:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 384 states have (on average 1.5546875) internal successors, (597), 390 states have internal predecessors, (597), 81 states have call successors, (81), 29 states have call predecessors, (81), 31 states have return successors, (87), 79 states have call predecessors, (87), 80 states have call successors, (87) [2025-01-09 03:55:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 765 transitions. [2025-01-09 03:55:49,852 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 765 transitions. Word has length 167 [2025-01-09 03:55:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:49,852 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 765 transitions. [2025-01-09 03:55:49,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 8 states have internal predecessors, (103), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:55:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 765 transitions. [2025-01-09 03:55:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:55:49,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:49,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:49,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:55:49,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:49,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash -982704056, now seen corresponding path program 2 times [2025-01-09 03:55:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:49,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543642900] [2025-01-09 03:55:49,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:55:49,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:49,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-01-09 03:55:49,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:55:49,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:55:49,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 03:55:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543642900] [2025-01-09 03:55:50,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543642900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:50,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:50,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:55:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733306326] [2025-01-09 03:55:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:50,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:55:50,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:50,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:55:50,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:55:50,014 INFO L87 Difference]: Start difference. First operand 497 states and 765 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:55:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:50,093 INFO L93 Difference]: Finished difference Result 967 states and 1498 transitions. [2025-01-09 03:55:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:55:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 168 [2025-01-09 03:55:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:50,097 INFO L225 Difference]: With dead ends: 967 [2025-01-09 03:55:50,097 INFO L226 Difference]: Without dead ends: 499 [2025-01-09 03:55:50,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:55:50,099 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 2 mSDsluCounter, 3112 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3740 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:50,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3740 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:55:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-01-09 03:55:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-01-09 03:55:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 385 states have (on average 1.5532467532467533) internal successors, (598), 392 states have internal predecessors, (598), 81 states have call successors, (81), 29 states have call predecessors, (81), 32 states have return successors, (92), 79 states have call predecessors, (92), 80 states have call successors, (92) [2025-01-09 03:55:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 771 transitions. [2025-01-09 03:55:50,121 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 771 transitions. Word has length 168 [2025-01-09 03:55:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:50,122 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 771 transitions. [2025-01-09 03:55:50,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-01-09 03:55:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 771 transitions. [2025-01-09 03:55:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 03:55:50,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:50,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:50,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:55:50,125 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:50,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1804765974, now seen corresponding path program 1 times [2025-01-09 03:55:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:50,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117468569] [2025-01-09 03:55:50,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:50,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 03:55:50,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 03:55:50,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:50,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:55:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:50,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117468569] [2025-01-09 03:55:50,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117468569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:50,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433935815] [2025-01-09 03:55:50,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:50,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:50,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:50,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:50,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:55:50,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 03:55:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 03:55:50,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:50,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:50,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:50,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:50,676 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:55:50,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:55:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:55:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433935815] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:55:50,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:55:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:55:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497033391] [2025-01-09 03:55:50,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:55:50,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:55:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:50,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:55:50,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:50,803 INFO L87 Difference]: Start difference. First operand 499 states and 771 transitions. Second operand has 11 states, 10 states have (on average 16.2) internal successors, (162), 11 states have internal predecessors, (162), 4 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (40), 3 states have call predecessors, (40), 4 states have call successors, (40) [2025-01-09 03:55:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:51,394 INFO L93 Difference]: Finished difference Result 1406 states and 2270 transitions. [2025-01-09 03:55:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:55:51,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.2) internal successors, (162), 11 states have internal predecessors, (162), 4 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (40), 3 states have call predecessors, (40), 4 states have call successors, (40) Word has length 169 [2025-01-09 03:55:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:51,400 INFO L225 Difference]: With dead ends: 1406 [2025-01-09 03:55:51,400 INFO L226 Difference]: Without dead ends: 937 [2025-01-09 03:55:51,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 335 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-01-09 03:55:51,404 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 1499 mSDsluCounter, 4327 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 4958 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:51,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 4958 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:55:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-01-09 03:55:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 911. [2025-01-09 03:55:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 718 states have (on average 1.6128133704735377) internal successors, (1158), 725 states have internal predecessors, (1158), 160 states have call successors, (160), 29 states have call predecessors, (160), 32 states have return successors, (181), 158 states have call predecessors, (181), 159 states have call successors, (181) [2025-01-09 03:55:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1499 transitions. [2025-01-09 03:55:51,442 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1499 transitions. Word has length 169 [2025-01-09 03:55:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:51,443 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1499 transitions. [2025-01-09 03:55:51,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.2) internal successors, (162), 11 states have internal predecessors, (162), 4 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (40), 3 states have call predecessors, (40), 4 states have call successors, (40) [2025-01-09 03:55:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1499 transitions. [2025-01-09 03:55:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:55:51,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:51,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:51,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:51,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:51,654 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:51,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1003613602, now seen corresponding path program 1 times [2025-01-09 03:55:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580419286] [2025-01-09 03:55:51,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:51,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:55:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:55:51,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:51,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:51,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580419286] [2025-01-09 03:55:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580419286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89491464] [2025-01-09 03:55:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:51,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:51,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:51,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:51,720 INFO L87 Difference]: Start difference. First operand 911 states and 1499 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:51,784 INFO L93 Difference]: Finished difference Result 2135 states and 3574 transitions. [2025-01-09 03:55:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:51,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2025-01-09 03:55:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:51,792 INFO L225 Difference]: With dead ends: 2135 [2025-01-09 03:55:51,792 INFO L226 Difference]: Without dead ends: 1302 [2025-01-09 03:55:51,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:51,795 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 131 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:51,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1274 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-01-09 03:55:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1294. [2025-01-09 03:55:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1022 states have (on average 1.6350293542074363) internal successors, (1671), 1029 states have internal predecessors, (1671), 239 states have call successors, (239), 29 states have call predecessors, (239), 32 states have return successors, (270), 237 states have call predecessors, (270), 238 states have call successors, (270) [2025-01-09 03:55:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2180 transitions. [2025-01-09 03:55:51,852 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2180 transitions. Word has length 154 [2025-01-09 03:55:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:51,852 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 2180 transitions. [2025-01-09 03:55:51,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2180 transitions. [2025-01-09 03:55:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:55:51,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:51,860 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:51,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:55:51,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:51,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1979944455, now seen corresponding path program 1 times [2025-01-09 03:55:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871640322] [2025-01-09 03:55:51,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:51,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:55:51,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:55:51,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:51,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871640322] [2025-01-09 03:55:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871640322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881927016] [2025-01-09 03:55:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:51,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:51,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:51,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:51,921 INFO L87 Difference]: Start difference. First operand 1294 states and 2180 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:51,980 INFO L93 Difference]: Finished difference Result 3092 states and 5250 transitions. [2025-01-09 03:55:51,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:51,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2025-01-09 03:55:51,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:51,993 INFO L225 Difference]: With dead ends: 3092 [2025-01-09 03:55:51,993 INFO L226 Difference]: Without dead ends: 1927 [2025-01-09 03:55:51,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:51,999 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 129 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:51,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1262 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2025-01-09 03:55:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1919. [2025-01-09 03:55:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1919 states, 1528 states have (on average 1.6472513089005236) internal successors, (2517), 1535 states have internal predecessors, (2517), 358 states have call successors, (358), 29 states have call predecessors, (358), 32 states have return successors, (389), 356 states have call predecessors, (389), 357 states have call successors, (389) [2025-01-09 03:55:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 3264 transitions. [2025-01-09 03:55:52,090 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 3264 transitions. Word has length 155 [2025-01-09 03:55:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:52,091 INFO L471 AbstractCegarLoop]: Abstraction has 1919 states and 3264 transitions. [2025-01-09 03:55:52,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 3264 transitions. [2025-01-09 03:55:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:55:52,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:52,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:52,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:55:52,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 823609680, now seen corresponding path program 1 times [2025-01-09 03:55:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989251147] [2025-01-09 03:55:52,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:52,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:55:52,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:55:52,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:52,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:52,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:52,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989251147] [2025-01-09 03:55:52,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989251147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103078625] [2025-01-09 03:55:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:52,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:52,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:52,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:52,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:52,159 INFO L87 Difference]: Start difference. First operand 1919 states and 3264 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:52,255 INFO L93 Difference]: Finished difference Result 4544 states and 7799 transitions. [2025-01-09 03:55:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:52,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-01-09 03:55:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:52,272 INFO L225 Difference]: With dead ends: 4544 [2025-01-09 03:55:52,272 INFO L226 Difference]: Without dead ends: 2885 [2025-01-09 03:55:52,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:52,279 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 127 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 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-01-09 03:55:52,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2025-01-09 03:55:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2877. [2025-01-09 03:55:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2324 states have (on average 1.6570567986230638) internal successors, (3851), 2331 states have internal predecessors, (3851), 520 states have call successors, (520), 29 states have call predecessors, (520), 32 states have return successors, (567), 518 states have call predecessors, (567), 519 states have call successors, (567) [2025-01-09 03:55:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 4938 transitions. [2025-01-09 03:55:52,397 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 4938 transitions. Word has length 156 [2025-01-09 03:55:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:52,398 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 4938 transitions. [2025-01-09 03:55:52,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 4938 transitions. [2025-01-09 03:55:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:55:52,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:52,413 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:52,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:55:52,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:52,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -260163910, now seen corresponding path program 1 times [2025-01-09 03:55:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:52,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223995322] [2025-01-09 03:55:52,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:52,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:55:52,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:55:52,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:52,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:52,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223995322] [2025-01-09 03:55:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223995322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:52,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:52,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:52,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499566797] [2025-01-09 03:55:52,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:52,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:52,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:52,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:52,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:52,467 INFO L87 Difference]: Start difference. First operand 2877 states and 4938 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:52,585 INFO L93 Difference]: Finished difference Result 6837 states and 11831 transitions. [2025-01-09 03:55:52,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 157 [2025-01-09 03:55:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:52,612 INFO L225 Difference]: With dead ends: 6837 [2025-01-09 03:55:52,613 INFO L226 Difference]: Without dead ends: 4432 [2025-01-09 03:55:52,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:52,624 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 125 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 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-01-09 03:55:52,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2025-01-09 03:55:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 4424. [2025-01-09 03:55:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 3626 states have (on average 1.664092664092664) internal successors, (6034), 3633 states have internal predecessors, (6034), 765 states have call successors, (765), 29 states have call predecessors, (765), 32 states have return successors, (838), 763 states have call predecessors, (838), 764 states have call successors, (838) [2025-01-09 03:55:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 7637 transitions. [2025-01-09 03:55:52,857 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 7637 transitions. Word has length 157 [2025-01-09 03:55:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:52,857 INFO L471 AbstractCegarLoop]: Abstraction has 4424 states and 7637 transitions. [2025-01-09 03:55:52,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:52,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 7637 transitions. [2025-01-09 03:55:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 03:55:52,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:52,880 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:55:52,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1221517908, now seen corresponding path program 1 times [2025-01-09 03:55:52,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:52,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144829737] [2025-01-09 03:55:52,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:52,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:52,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:55:52,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:55:52,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:52,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144829737] [2025-01-09 03:55:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144829737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:52,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989158283] [2025-01-09 03:55:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:52,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:52,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:52,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:52,934 INFO L87 Difference]: Start difference. First operand 4424 states and 7637 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:53,155 INFO L93 Difference]: Finished difference Result 10931 states and 18983 transitions. [2025-01-09 03:55:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:53,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-01-09 03:55:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:53,205 INFO L225 Difference]: With dead ends: 10931 [2025-01-09 03:55:53,206 INFO L226 Difference]: Without dead ends: 7220 [2025-01-09 03:55:53,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:53,223 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 123 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:53,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1285 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7220 states. [2025-01-09 03:55:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7220 to 7212. [2025-01-09 03:55:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7212 states, 5921 states have (on average 1.6615436581658503) internal successors, (9838), 5928 states have internal predecessors, (9838), 1258 states have call successors, (1258), 29 states have call predecessors, (1258), 32 states have return successors, (1375), 1256 states have call predecessors, (1375), 1257 states have call successors, (1375) [2025-01-09 03:55:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 12471 transitions. [2025-01-09 03:55:53,559 INFO L78 Accepts]: Start accepts. Automaton has 7212 states and 12471 transitions. Word has length 158 [2025-01-09 03:55:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:53,559 INFO L471 AbstractCegarLoop]: Abstraction has 7212 states and 12471 transitions. [2025-01-09 03:55:53,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 7212 states and 12471 transitions. [2025-01-09 03:55:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 03:55:53,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:53,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:53,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:55:53,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:53,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1479514718, now seen corresponding path program 1 times [2025-01-09 03:55:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588341482] [2025-01-09 03:55:53,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:53,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 03:55:53,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:55:53,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:53,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:53,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:53,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588341482] [2025-01-09 03:55:53,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588341482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:53,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:53,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:53,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411201500] [2025-01-09 03:55:53,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:53,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:53,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:53,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:53,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:53,692 INFO L87 Difference]: Start difference. First operand 7212 states and 12471 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:53,930 INFO L93 Difference]: Finished difference Result 18218 states and 31703 transitions. [2025-01-09 03:55:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:53,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 159 [2025-01-09 03:55:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:53,990 INFO L225 Difference]: With dead ends: 18218 [2025-01-09 03:55:53,991 INFO L226 Difference]: Without dead ends: 12105 [2025-01-09 03:55:54,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:54,022 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 121 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:54,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1274 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:54,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12105 states. [2025-01-09 03:55:54,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12105 to 12097. [2025-01-09 03:55:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12097 states, 9984 states have (on average 1.662159455128205) internal successors, (16595), 9991 states have internal predecessors, (16595), 2080 states have call successors, (2080), 29 states have call predecessors, (2080), 32 states have return successors, (2275), 2078 states have call predecessors, (2275), 2079 states have call successors, (2275) [2025-01-09 03:55:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12097 states to 12097 states and 20950 transitions. [2025-01-09 03:55:54,574 INFO L78 Accepts]: Start accepts. Automaton has 12097 states and 20950 transitions. Word has length 159 [2025-01-09 03:55:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:54,575 INFO L471 AbstractCegarLoop]: Abstraction has 12097 states and 20950 transitions. [2025-01-09 03:55:54,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12097 states and 20950 transitions. [2025-01-09 03:55:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:55:54,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:54,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:54,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:55:54,624 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:54,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1124587186, now seen corresponding path program 1 times [2025-01-09 03:55:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:54,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562668126] [2025-01-09 03:55:54,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:54,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:54,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:55:54,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:55:54,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:54,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:54,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:54,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562668126] [2025-01-09 03:55:54,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562668126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:54,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:54,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:54,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080427411] [2025-01-09 03:55:54,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:54,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:54,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:54,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:54,689 INFO L87 Difference]: Start difference. First operand 12097 states and 20950 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:55,279 INFO L93 Difference]: Finished difference Result 28938 states and 50044 transitions. [2025-01-09 03:55:55,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:55,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-01-09 03:55:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:55,384 INFO L225 Difference]: With dead ends: 28938 [2025-01-09 03:55:55,385 INFO L226 Difference]: Without dead ends: 18892 [2025-01-09 03:55:55,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:55,438 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 119 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 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-01-09 03:55:55,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1234 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18892 states. [2025-01-09 03:55:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18892 to 18884. [2025-01-09 03:55:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18884 states, 15568 states have (on average 1.6379110996916753) internal successors, (25499), 15575 states have internal predecessors, (25499), 3283 states have call successors, (3283), 29 states have call predecessors, (3283), 32 states have return successors, (3622), 3281 states have call predecessors, (3622), 3282 states have call successors, (3622) [2025-01-09 03:55:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18884 states to 18884 states and 32404 transitions. [2025-01-09 03:55:56,411 INFO L78 Accepts]: Start accepts. Automaton has 18884 states and 32404 transitions. Word has length 160 [2025-01-09 03:55:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:56,411 INFO L471 AbstractCegarLoop]: Abstraction has 18884 states and 32404 transitions. [2025-01-09 03:55:56,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18884 states and 32404 transitions. [2025-01-09 03:55:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 03:55:56,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:56,465 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:56,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:55:56,465 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:56,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1462080833, now seen corresponding path program 1 times [2025-01-09 03:55:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:56,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138110581] [2025-01-09 03:55:56,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:56,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 03:55:56,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 03:55:56,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:56,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138110581] [2025-01-09 03:55:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138110581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:56,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:56,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:56,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678401071] [2025-01-09 03:55:56,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:56,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:56,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:56,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:56,530 INFO L87 Difference]: Start difference. First operand 18884 states and 32404 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:57,224 INFO L93 Difference]: Finished difference Result 49930 states and 85982 transitions. [2025-01-09 03:55:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:57,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-01-09 03:55:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:57,374 INFO L225 Difference]: With dead ends: 49930 [2025-01-09 03:55:57,374 INFO L226 Difference]: Without dead ends: 33710 [2025-01-09 03:55:57,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:57,427 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 117 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:57,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1262 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33710 states. [2025-01-09 03:55:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33710 to 33702. [2025-01-09 03:55:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33702 states, 27936 states have (on average 1.6345217640320733) internal successors, (45662), 27943 states have internal predecessors, (45662), 5733 states have call successors, (5733), 29 states have call predecessors, (5733), 32 states have return successors, (6346), 5731 states have call predecessors, (6346), 5732 states have call successors, (6346) [2025-01-09 03:55:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33702 states to 33702 states and 57741 transitions. [2025-01-09 03:55:58,890 INFO L78 Accepts]: Start accepts. Automaton has 33702 states and 57741 transitions. Word has length 161 [2025-01-09 03:55:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:58,890 INFO L471 AbstractCegarLoop]: Abstraction has 33702 states and 57741 transitions. [2025-01-09 03:55:58,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33702 states and 57741 transitions. [2025-01-09 03:55:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:55:58,963 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:58,963 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:58,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:55:58,963 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:58,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash 209318920, now seen corresponding path program 1 times [2025-01-09 03:55:58,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:58,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453631466] [2025-01-09 03:55:58,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:58,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:58,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:55:58,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:55:58,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:58,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453631466] [2025-01-09 03:55:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453631466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:59,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678572163] [2025-01-09 03:55:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:59,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:59,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:59,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:59,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:59,041 INFO L87 Difference]: Start difference. First operand 33702 states and 57741 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:00,556 INFO L93 Difference]: Finished difference Result 91967 states and 158014 transitions. [2025-01-09 03:56:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:00,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2025-01-09 03:56:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:00,828 INFO L225 Difference]: With dead ends: 91967 [2025-01-09 03:56:00,828 INFO L226 Difference]: Without dead ends: 61808 [2025-01-09 03:56:00,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:00,917 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 115 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:00,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1270 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61808 states. [2025-01-09 03:56:02,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61808 to 61800. [2025-01-09 03:56:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61800 states, 51521 states have (on average 1.6299761262397858) internal successors, (83978), 51528 states have internal predecessors, (83978), 10246 states have call successors, (10246), 29 states have call predecessors, (10246), 32 states have return successors, (11391), 10244 states have call predecessors, (11391), 10245 states have call successors, (11391) [2025-01-09 03:56:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61800 states to 61800 states and 105615 transitions. [2025-01-09 03:56:03,087 INFO L78 Accepts]: Start accepts. Automaton has 61800 states and 105615 transitions. Word has length 162 [2025-01-09 03:56:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 61800 states and 105615 transitions. [2025-01-09 03:56:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 61800 states and 105615 transitions. [2025-01-09 03:56:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 03:56:03,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:03,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:03,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:56:03,187 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:03,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1396086209, now seen corresponding path program 1 times [2025-01-09 03:56:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:03,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162276467] [2025-01-09 03:56:03,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:03,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:56:03,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:56:03,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:03,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:03,253 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162276467] [2025-01-09 03:56:03,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162276467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:03,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:03,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811604612] [2025-01-09 03:56:03,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:03,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:03,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:03,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:03,255 INFO L87 Difference]: Start difference. First operand 61800 states and 105615 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:05,792 INFO L93 Difference]: Finished difference Result 115824 states and 198303 transitions. [2025-01-09 03:56:05,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:05,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-01-09 03:56:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:06,505 INFO L225 Difference]: With dead ends: 115824 [2025-01-09 03:56:06,505 INFO L226 Difference]: Without dead ends: 115593 [2025-01-09 03:56:06,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:06,544 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 110 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:06,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1268 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115593 states. [2025-01-09 03:56:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115593 to 115585. [2025-01-09 03:56:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115585 states, 96938 states have (on average 1.6243165734799563) internal successors, (157458), 96945 states have internal predecessors, (157458), 18614 states have call successors, (18614), 29 states have call predecessors, (18614), 32 states have return successors, (20805), 18612 states have call predecessors, (20805), 18613 states have call successors, (20805) [2025-01-09 03:56:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115585 states to 115585 states and 196877 transitions. [2025-01-09 03:56:10,585 INFO L78 Accepts]: Start accepts. Automaton has 115585 states and 196877 transitions. Word has length 163 [2025-01-09 03:56:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:10,586 INFO L471 AbstractCegarLoop]: Abstraction has 115585 states and 196877 transitions. [2025-01-09 03:56:10,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 115585 states and 196877 transitions. [2025-01-09 03:56:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 03:56:10,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:10,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:10,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:56:10,721 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:10,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:10,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1306971175, now seen corresponding path program 1 times [2025-01-09 03:56:10,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:10,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405497871] [2025-01-09 03:56:10,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:10,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:10,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:56:10,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:56:10,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:10,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:56:11,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:11,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405497871] [2025-01-09 03:56:11,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405497871] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:11,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424667269] [2025-01-09 03:56:11,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:11,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:11,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:11,301 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-01-09 03:56:11,303 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-01-09 03:56:11,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:56:11,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:56:11,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:11,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:11,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 03:56:11,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:56:11,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:56:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:56:12,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424667269] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:56:12,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:56:12,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-01-09 03:56:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647051434] [2025-01-09 03:56:12,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:56:12,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 03:56:12,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:12,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 03:56:12,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-01-09 03:56:12,124 INFO L87 Difference]: Start difference. First operand 115585 states and 196877 transitions. Second operand has 28 states, 26 states have (on average 10.038461538461538) internal successors, (261), 24 states have internal predecessors, (261), 9 states have call successors, (54), 8 states have call predecessors, (54), 12 states have return successors, (47), 11 states have call predecessors, (47), 9 states have call successors, (47) [2025-01-09 03:56:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:28,030 INFO L93 Difference]: Finished difference Result 460839 states and 808853 transitions. [2025-01-09 03:56:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-01-09 03:56:28,030 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 10.038461538461538) internal successors, (261), 24 states have internal predecessors, (261), 9 states have call successors, (54), 8 states have call predecessors, (54), 12 states have return successors, (47), 11 states have call predecessors, (47), 9 states have call successors, (47) Word has length 164 [2025-01-09 03:56:28,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.