./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product35.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_spec27_product35.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 66ba4360d8cd17925c78e04f17940e3bee0e828bd2ae8cc06c9e6a2549687bf9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:52:28,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:52:28,740 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:52:28,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:52:28,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:52:28,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:52:28,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:52:28,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:52:28,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:52:28,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:52:28,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:52:28,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:52:28,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:52:28,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:52:28,760 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:52:28,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:52:28,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:52:28,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:28,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:28,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:52:28,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:52:28,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:52:28,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:52:28,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:52:28,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:52:28,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:52:28,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:52:28,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:52:28,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:52:28,763 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 -> 66ba4360d8cd17925c78e04f17940e3bee0e828bd2ae8cc06c9e6a2549687bf9 [2025-01-09 03:52:28,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:52:28,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:52:28,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:52:29,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:52:29,001 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:52:29,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product35.cil.c [2025-01-09 03:52:30,247 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/619bf84f3/4d01d2d8471e483d990d18cc572bce04/FLAG0523c6650 [2025-01-09 03:52:30,605 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:52:30,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product35.cil.c [2025-01-09 03:52:30,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/619bf84f3/4d01d2d8471e483d990d18cc572bce04/FLAG0523c6650 [2025-01-09 03:52:30,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/619bf84f3/4d01d2d8471e483d990d18cc572bce04 [2025-01-09 03:52:30,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:52:30,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:52:30,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:30,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:52:30,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:52:30,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c81db33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30, skipping insertion in model container [2025-01-09 03:52:30,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:52:31,238 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_spec27_product35.cil.c[40704,40717] [2025-01-09 03:52:31,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:31,389 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:52:31,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-01-09 03:52:31,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [208] [2025-01-09 03:52:31,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [225] [2025-01-09 03:52:31,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1305] [2025-01-09 03:52:31,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1671] [2025-01-09 03:52:31,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1680] [2025-01-09 03:52:31,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1718] [2025-01-09 03:52:31,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2120] [2025-01-09 03:52:31,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2560] [2025-01-09 03:52:31,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2591] [2025-01-09 03:52:31,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2901] [2025-01-09 03:52:31,474 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_spec27_product35.cil.c[40704,40717] [2025-01-09 03:52:31,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:31,533 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:52:31,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31 WrapperNode [2025-01-09 03:52:31,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:31,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:31,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:52:31,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:52:31,541 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:52:31" (1/1) ... [2025-01-09 03:52:31,569 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:52:31" (1/1) ... [2025-01-09 03:52:31,630 INFO L138 Inliner]: procedures = 137, calls = 228, calls flagged for inlining = 65, calls inlined = 62, statements flattened = 1142 [2025-01-09 03:52:31,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:31,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:52:31,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:52:31,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:52:31,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,687 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:52:31,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,708 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,743 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:52:31,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:52:31,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:52:31,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:52:31,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (1/1) ... [2025-01-09 03:52:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:31,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:31,773 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:52:31,775 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:52:31,792 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:52:31,792 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:52:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:52:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:52:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:52:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:52:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:52:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:52:31,793 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:52:31,793 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:52:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:52:31,794 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:52:31,794 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:52:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:52:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:52:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:52:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:52:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:52:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:52:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:52:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:52:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:52:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:52:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:52:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:52:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:52:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:52:31,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:52:31,795 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:52:31,796 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:52:31,796 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:52:31,797 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:52:31,797 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:52:31,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:52:31,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:52:31,956 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:52:31,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:52:32,898 INFO L? ?]: Removed 606 outVars from TransFormulas that were not future-live. [2025-01-09 03:52:32,898 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:52:32,909 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:52:32,910 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:52:32,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:32 BoogieIcfgContainer [2025-01-09 03:52:32,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:52:32,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:52:32,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:52:32,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:52:32,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:52:30" (1/3) ... [2025-01-09 03:52:32,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2167265a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:32, skipping insertion in model container [2025-01-09 03:52:32,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:31" (2/3) ... [2025-01-09 03:52:32,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2167265a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:32, skipping insertion in model container [2025-01-09 03:52:32,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:32" (3/3) ... [2025-01-09 03:52:32,916 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product35.cil.c [2025-01-09 03:52:32,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:52:32,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product35.cil.c that has 31 procedures, 471 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:52:32,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:52:32,975 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;@1ac6bebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:52:32,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:52:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 471 states, 362 states have (on average 1.5303867403314917) internal successors, (554), 367 states have internal predecessors, (554), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 03:52:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:52:32,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:32,995 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2025-01-09 03:52:32,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:33,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1211434879, now seen corresponding path program 1 times [2025-01-09 03:52:33,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:33,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821703993] [2025-01-09 03:52:33,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:33,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:33,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:52:33,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:52:33,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:33,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:33,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:33,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821703993] [2025-01-09 03:52:33,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821703993] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:33,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595669032] [2025-01-09 03:52:33,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:33,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:33,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:33,646 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:52:33,649 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:52:33,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:52:33,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:52:33,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:33,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:33,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1273 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:52:33,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:52:33,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595669032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:33,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:33,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:52:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369998785] [2025-01-09 03:52:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:33,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:52:33,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:33,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:52:33,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:34,001 INFO L87 Difference]: Start difference. First operand has 471 states, 362 states have (on average 1.5303867403314917) internal successors, (554), 367 states have internal predecessors, (554), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:34,073 INFO L93 Difference]: Finished difference Result 745 states and 1100 transitions. [2025-01-09 03:52:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:52:34,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2025-01-09 03:52:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:34,085 INFO L225 Difference]: With dead ends: 745 [2025-01-09 03:52:34,085 INFO L226 Difference]: Without dead ends: 464 [2025-01-09 03:52:34,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 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:52:34,096 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:34,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-09 03:52:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-01-09 03:52:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 356 states have (on average 1.5280898876404494) internal successors, (544), 360 states have internal predecessors, (544), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 03:52:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 697 transitions. [2025-01-09 03:52:34,150 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 697 transitions. Word has length 151 [2025-01-09 03:52:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:34,151 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 697 transitions. [2025-01-09 03:52:34,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 697 transitions. [2025-01-09 03:52:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 03:52:34,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:34,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-01-09 03:52:34,170 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:52:34,361 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:52:34,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:34,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1523530852, now seen corresponding path program 1 times [2025-01-09 03:52:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926546992] [2025-01-09 03:52:34,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:34,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:52:34,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:52:34,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:34,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 03:52:34,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:34,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926546992] [2025-01-09 03:52:34,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926546992] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:34,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160883573] [2025-01-09 03:52:34,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:34,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:34,697 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:52:34,699 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:52:34,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:52:35,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:52:35,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:35,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:35,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:52:35,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 03:52:35,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160883573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:35,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341684648] [2025-01-09 03:52:35,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:35,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:35,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:35,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:35,058 INFO L87 Difference]: Start difference. First operand 464 states and 697 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:35,095 INFO L93 Difference]: Finished difference Result 734 states and 1078 transitions. [2025-01-09 03:52:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:35,096 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 170 [2025-01-09 03:52:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:35,102 INFO L225 Difference]: With dead ends: 734 [2025-01-09 03:52:35,102 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 03:52:35,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 170 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:52:35,104 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 1 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:35,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1388 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 03:52:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 465. [2025-01-09 03:52:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 357 states have (on average 1.526610644257703) internal successors, (545), 361 states have internal predecessors, (545), 77 states have call successors, (77), 30 states have call predecessors, (77), 30 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 03:52:35,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 698 transitions. [2025-01-09 03:52:35,141 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 698 transitions. Word has length 170 [2025-01-09 03:52:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:35,141 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 698 transitions. [2025-01-09 03:52:35,142 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 698 transitions. [2025-01-09 03:52:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 03:52:35,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:35,145 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1] [2025-01-09 03:52:35,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:35,346 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:52:35,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:35,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2006361391, now seen corresponding path program 1 times [2025-01-09 03:52:35,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:35,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404809535] [2025-01-09 03:52:35,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:35,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:35,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 03:52:35,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 03:52:35,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:35,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:52:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404809535] [2025-01-09 03:52:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404809535] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305485786] [2025-01-09 03:52:35,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:35,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:35,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:35,590 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:52:35,591 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:52:35,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 03:52:35,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 03:52:35,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:35,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:35,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1375 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:35,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 03:52:35,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305485786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:35,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:35,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:35,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19871758] [2025-01-09 03:52:35,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:35,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:35,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:35,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:35,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:35,930 INFO L87 Difference]: Start difference. First operand 465 states and 698 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:35,956 INFO L93 Difference]: Finished difference Result 983 states and 1496 transitions. [2025-01-09 03:52:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:35,957 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 178 [2025-01-09 03:52:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:35,960 INFO L225 Difference]: With dead ends: 983 [2025-01-09 03:52:35,960 INFO L226 Difference]: Without dead ends: 544 [2025-01-09 03:52:35,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 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:52:35,962 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 142 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1372 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:52:35,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1372 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-01-09 03:52:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 536. [2025-01-09 03:52:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 418 states have internal predecessors, (641), 91 states have call successors, (91), 30 states have call predecessors, (91), 30 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:52:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 822 transitions. [2025-01-09 03:52:35,980 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 822 transitions. Word has length 178 [2025-01-09 03:52:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:35,980 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 822 transitions. [2025-01-09 03:52:35,980 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 822 transitions. [2025-01-09 03:52:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:52:35,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:35,983 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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] [2025-01-09 03:52:35,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:52:36,187 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:52:36,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:36,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1720309004, now seen corresponding path program 1 times [2025-01-09 03:52:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:36,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809859480] [2025-01-09 03:52:36,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:36,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:52:36,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:52:36,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:36,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:36,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:36,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809859480] [2025-01-09 03:52:36,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809859480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:36,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572872197] [2025-01-09 03:52:36,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:36,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:36,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:36,360 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:52:36,365 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:52:36,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:52:36,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:52:36,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:36,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:36,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:52:36,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:36,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572872197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:36,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:52:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979908882] [2025-01-09 03:52:36,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:36,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:36,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:36,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:36,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:36,690 INFO L87 Difference]: Start difference. First operand 536 states and 822 transitions. Second operand has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:36,788 INFO L93 Difference]: Finished difference Result 1063 states and 1634 transitions. [2025-01-09 03:52:36,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:36,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 03:52:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:36,792 INFO L225 Difference]: With dead ends: 1063 [2025-01-09 03:52:36,792 INFO L226 Difference]: Without dead ends: 538 [2025-01-09 03:52:36,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 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:52:36,800 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2745 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:52:36,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2745 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-09 03:52:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-01-09 03:52:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 415 states have (on average 1.546987951807229) internal successors, (642), 420 states have internal predecessors, (642), 91 states have call successors, (91), 30 states have call predecessors, (91), 31 states have return successors, (92), 89 states have call predecessors, (92), 90 states have call successors, (92) [2025-01-09 03:52:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 825 transitions. [2025-01-09 03:52:36,840 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 825 transitions. Word has length 160 [2025-01-09 03:52:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:36,840 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 825 transitions. [2025-01-09 03:52:36,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 825 transitions. [2025-01-09 03:52:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 03:52:36,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:36,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1] [2025-01-09 03:52:36,853 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:52:37,044 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:52:37,045 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:37,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:37,045 INFO L85 PathProgramCache]: Analyzing trace with hash 551813849, now seen corresponding path program 1 times [2025-01-09 03:52:37,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:37,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922958201] [2025-01-09 03:52:37,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:37,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 03:52:37,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 03:52:37,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:37,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:52:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922958201] [2025-01-09 03:52:37,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922958201] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088585076] [2025-01-09 03:52:37,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:37,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:37,261 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:52:37,267 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:52:37,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 03:52:37,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 03:52:37,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:37,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:37,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:52:37,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:37,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088585076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:37,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:52:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20193626] [2025-01-09 03:52:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:37,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:37,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:37,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:37,619 INFO L87 Difference]: Start difference. First operand 538 states and 825 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:37,699 INFO L93 Difference]: Finished difference Result 1065 states and 1639 transitions. [2025-01-09 03:52:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:37,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2025-01-09 03:52:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:37,705 INFO L225 Difference]: With dead ends: 1065 [2025-01-09 03:52:37,706 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 03:52:37,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 178 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:52:37,709 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 2 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2731 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:52:37,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2731 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 03:52:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-01-09 03:52:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 422 states have internal predecessors, (643), 91 states have call successors, (91), 30 states have call predecessors, (91), 32 states have return successors, (97), 89 states have call predecessors, (97), 90 states have call successors, (97) [2025-01-09 03:52:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 831 transitions. [2025-01-09 03:52:37,746 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 831 transitions. Word has length 180 [2025-01-09 03:52:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:37,746 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 831 transitions. [2025-01-09 03:52:37,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 831 transitions. [2025-01-09 03:52:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 03:52:37,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:37,751 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:37,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:52:37,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:37,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:37,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 563507098, now seen corresponding path program 1 times [2025-01-09 03:52:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:37,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162891953] [2025-01-09 03:52:37,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:37,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 03:52:38,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 03:52:38,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:38,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:52:38,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:38,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162891953] [2025-01-09 03:52:38,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162891953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:38,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:38,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:38,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911494556] [2025-01-09 03:52:38,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:38,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:38,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:38,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:38,126 INFO L87 Difference]: Start difference. First operand 540 states and 831 transitions. Second operand has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:38,169 INFO L93 Difference]: Finished difference Result 1057 states and 1630 transitions. [2025-01-09 03:52:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 181 [2025-01-09 03:52:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:38,173 INFO L225 Difference]: With dead ends: 1057 [2025-01-09 03:52:38,175 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 03:52:38,177 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:52:38,177 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 2 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2749 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:52:38,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2749 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 03:52:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-01-09 03:52:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 422 states have internal predecessors, (643), 91 states have call successors, (91), 30 states have call predecessors, (91), 32 states have return successors, (96), 89 states have call predecessors, (96), 90 states have call successors, (96) [2025-01-09 03:52:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 830 transitions. [2025-01-09 03:52:38,198 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 830 transitions. Word has length 181 [2025-01-09 03:52:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:38,198 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 830 transitions. [2025-01-09 03:52:38,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 830 transitions. [2025-01-09 03:52:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 03:52:38,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:38,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-01-09 03:52:38,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:52:38,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:38,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:38,201 INFO L85 PathProgramCache]: Analyzing trace with hash -534524119, now seen corresponding path program 1 times [2025-01-09 03:52:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:38,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229432800] [2025-01-09 03:52:38,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:38,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:52:38,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:52:38,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:38,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:38,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:38,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229432800] [2025-01-09 03:52:38,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229432800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:38,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155374607] [2025-01-09 03:52:38,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:38,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:38,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:38,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:38,362 INFO L87 Difference]: Start difference. First operand 540 states and 830 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:38,406 INFO L93 Difference]: Finished difference Result 1059 states and 1633 transitions. [2025-01-09 03:52:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:38,406 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 163 [2025-01-09 03:52:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:38,410 INFO L225 Difference]: With dead ends: 1059 [2025-01-09 03:52:38,410 INFO L226 Difference]: Without dead ends: 542 [2025-01-09 03:52:38,411 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:52:38,412 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2752 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:52:38,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2752 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:38,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-01-09 03:52:38,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-01-09 03:52:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 417 states have (on average 1.5443645083932853) internal successors, (644), 424 states have internal predecessors, (644), 91 states have call successors, (91), 30 states have call predecessors, (91), 33 states have return successors, (98), 89 states have call predecessors, (98), 90 states have call successors, (98) [2025-01-09 03:52:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 833 transitions. [2025-01-09 03:52:38,432 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 833 transitions. Word has length 163 [2025-01-09 03:52:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:38,433 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 833 transitions. [2025-01-09 03:52:38,433 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 833 transitions. [2025-01-09 03:52:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 03:52:38,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:38,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:38,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:52:38,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:38,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash -709397921, now seen corresponding path program 1 times [2025-01-09 03:52:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:38,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692141967] [2025-01-09 03:52:38,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:38,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:38,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 03:52:38,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 03:52:38,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:38,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:52:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692141967] [2025-01-09 03:52:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692141967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:38,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831961210] [2025-01-09 03:52:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:38,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:38,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:38,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:38,677 INFO L87 Difference]: Start difference. First operand 542 states and 833 transitions. Second operand has 8 states, 7 states have (on average 15.857142857142858) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:52:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:39,006 INFO L93 Difference]: Finished difference Result 1061 states and 1632 transitions. [2025-01-09 03:52:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:39,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.857142857142858) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 183 [2025-01-09 03:52:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:39,009 INFO L225 Difference]: With dead ends: 1061 [2025-01-09 03:52:39,009 INFO L226 Difference]: Without dead ends: 544 [2025-01-09 03:52:39,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:52:39,011 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 7 mSDsluCounter, 4057 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4738 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:39,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4738 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:52:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-01-09 03:52:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-01-09 03:52:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 419 states have (on average 1.541766109785203) internal successors, (646), 425 states have internal predecessors, (646), 91 states have call successors, (91), 31 states have call predecessors, (91), 33 states have return successors, (97), 89 states have call predecessors, (97), 90 states have call successors, (97) [2025-01-09 03:52:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 834 transitions. [2025-01-09 03:52:39,031 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 834 transitions. Word has length 183 [2025-01-09 03:52:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:39,031 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 834 transitions. [2025-01-09 03:52:39,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.857142857142858) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 03:52:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 834 transitions. [2025-01-09 03:52:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 03:52:39,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:39,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-01-09 03:52:39,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:52:39,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1677189089, now seen corresponding path program 1 times [2025-01-09 03:52:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853932463] [2025-01-09 03:52:39,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 03:52:39,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 03:52:39,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:39,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853932463] [2025-01-09 03:52:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853932463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:39,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:39,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574209853] [2025-01-09 03:52:39,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:39,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:39,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:39,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:39,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:39,163 INFO L87 Difference]: Start difference. First operand 544 states and 834 transitions. Second operand has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:52:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:39,298 INFO L93 Difference]: Finished difference Result 1064 states and 1639 transitions. [2025-01-09 03:52:39,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:39,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 165 [2025-01-09 03:52:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:39,302 INFO L225 Difference]: With dead ends: 1064 [2025-01-09 03:52:39,302 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 03:52:39,303 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:52:39,303 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 5 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4752 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:39,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4752 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 03:52:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-01-09 03:52:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 421 states have (on average 1.5391923990498813) internal successors, (648), 428 states have internal predecessors, (648), 91 states have call successors, (91), 31 states have call predecessors, (91), 34 states have return successors, (102), 89 states have call predecessors, (102), 90 states have call successors, (102) [2025-01-09 03:52:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 841 transitions. [2025-01-09 03:52:39,319 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 841 transitions. Word has length 165 [2025-01-09 03:52:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:39,319 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 841 transitions. [2025-01-09 03:52:39,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:52:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 841 transitions. [2025-01-09 03:52:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 03:52:39,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:39,322 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:39,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:52:39,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash 309149060, now seen corresponding path program 1 times [2025-01-09 03:52:39,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554098053] [2025-01-09 03:52:39,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 03:52:39,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 03:52:39,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:52:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554098053] [2025-01-09 03:52:39,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554098053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:39,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246519585] [2025-01-09 03:52:39,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:39,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:39,490 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:52:39,496 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:52:39,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 03:52:39,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 03:52:39,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:39,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:39,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:52:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:39,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246519585] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:52:39,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:52:39,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:52:39,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227660482] [2025-01-09 03:52:39,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:52:39,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:52:39,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:39,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:52:39,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:39,930 INFO L87 Difference]: Start difference. First operand 547 states and 841 transitions. Second operand has 11 states, 10 states have (on average 17.4) internal successors, (174), 11 states have internal predecessors, (174), 4 states have call successors, (47), 2 states have call predecessors, (47), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2025-01-09 03:52:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:40,506 INFO L93 Difference]: Finished difference Result 1526 states and 2449 transitions. [2025-01-09 03:52:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:52:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 17.4) internal successors, (174), 11 states have internal predecessors, (174), 4 states have call successors, (47), 2 states have call predecessors, (47), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) Word has length 185 [2025-01-09 03:52:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:40,512 INFO L225 Difference]: With dead ends: 1526 [2025-01-09 03:52:40,512 INFO L226 Difference]: Without dead ends: 1010 [2025-01-09 03:52:40,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 367 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:52:40,514 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1570 mSDsluCounter, 4213 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 4904 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:40,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 4904 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:52:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-01-09 03:52:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 986. [2025-01-09 03:52:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 781 states have (on average 1.6005121638924455) internal successors, (1250), 787 states have internal predecessors, (1250), 170 states have call successors, (170), 32 states have call predecessors, (170), 34 states have return successors, (191), 168 states have call predecessors, (191), 169 states have call successors, (191) [2025-01-09 03:52:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1611 transitions. [2025-01-09 03:52:40,547 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1611 transitions. Word has length 185 [2025-01-09 03:52:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:40,547 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1611 transitions. [2025-01-09 03:52:40,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 17.4) internal successors, (174), 11 states have internal predecessors, (174), 4 states have call successors, (47), 2 states have call predecessors, (47), 3 states have return successors, (44), 3 states have call predecessors, (44), 4 states have call successors, (44) [2025-01-09 03:52:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1611 transitions. [2025-01-09 03:52:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-09 03:52:40,551 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:40,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:40,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:52:40,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:52:40,753 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:40,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1047606603, now seen corresponding path program 1 times [2025-01-09 03:52:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:40,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461173596] [2025-01-09 03:52:40,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:40,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 03:52:40,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 03:52:40,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:40,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461173596] [2025-01-09 03:52:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461173596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:40,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:40,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651358628] [2025-01-09 03:52:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:40,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:40,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:40,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:40,807 INFO L87 Difference]: Start difference. First operand 986 states and 1611 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:40,847 INFO L93 Difference]: Finished difference Result 2307 states and 3835 transitions. [2025-01-09 03:52:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:40,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2025-01-09 03:52:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:40,855 INFO L225 Difference]: With dead ends: 2307 [2025-01-09 03:52:40,855 INFO L226 Difference]: Without dead ends: 1402 [2025-01-09 03:52:40,858 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:52:40,859 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 139 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1396 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:52:40,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1396 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-01-09 03:52:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1394. [2025-01-09 03:52:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1110 states have (on average 1.6243243243243244) internal successors, (1803), 1116 states have internal predecessors, (1803), 249 states have call successors, (249), 32 states have call predecessors, (249), 34 states have return successors, (280), 247 states have call predecessors, (280), 248 states have call successors, (280) [2025-01-09 03:52:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2332 transitions. [2025-01-09 03:52:40,910 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2332 transitions. Word has length 189 [2025-01-09 03:52:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:40,910 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2332 transitions. [2025-01-09 03:52:40,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2332 transitions. [2025-01-09 03:52:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 03:52:40,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:40,916 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:40,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:52:40,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:40,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1565232170, now seen corresponding path program 1 times [2025-01-09 03:52:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:40,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855622332] [2025-01-09 03:52:40,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:40,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 03:52:40,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 03:52:40,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855622332] [2025-01-09 03:52:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855622332] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384778620] [2025-01-09 03:52:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:40,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:40,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:40,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:40,969 INFO L87 Difference]: Start difference. First operand 1394 states and 2332 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:41,039 INFO L93 Difference]: Finished difference Result 3329 states and 5615 transitions. [2025-01-09 03:52:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-01-09 03:52:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:41,049 INFO L225 Difference]: With dead ends: 3329 [2025-01-09 03:52:41,049 INFO L226 Difference]: Without dead ends: 2067 [2025-01-09 03:52:41,053 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:52:41,054 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 137 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1384 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:52:41,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-01-09 03:52:41,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2059. [2025-01-09 03:52:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 1656 states have (on average 1.6382850241545894) internal successors, (2713), 1662 states have internal predecessors, (2713), 368 states have call successors, (368), 32 states have call predecessors, (368), 34 states have return successors, (399), 366 states have call predecessors, (399), 367 states have call successors, (399) [2025-01-09 03:52:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 3480 transitions. [2025-01-09 03:52:41,131 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 3480 transitions. Word has length 190 [2025-01-09 03:52:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:41,132 INFO L471 AbstractCegarLoop]: Abstraction has 2059 states and 3480 transitions. [2025-01-09 03:52:41,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 3480 transitions. [2025-01-09 03:52:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 03:52:41,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:41,141 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:41,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:52:41,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:41,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:41,142 INFO L85 PathProgramCache]: Analyzing trace with hash -619605219, now seen corresponding path program 1 times [2025-01-09 03:52:41,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:41,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237839394] [2025-01-09 03:52:41,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:41,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:41,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 03:52:41,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 03:52:41,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:41,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:41,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:41,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237839394] [2025-01-09 03:52:41,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237839394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:41,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:41,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:41,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507581683] [2025-01-09 03:52:41,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:41,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:41,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:41,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:41,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:41,198 INFO L87 Difference]: Start difference. First operand 2059 states and 3480 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:41,277 INFO L93 Difference]: Finished difference Result 4886 states and 8332 transitions. [2025-01-09 03:52:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:41,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-01-09 03:52:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:41,297 INFO L225 Difference]: With dead ends: 4886 [2025-01-09 03:52:41,297 INFO L226 Difference]: Without dead ends: 3090 [2025-01-09 03:52:41,305 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:52:41,306 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 135 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1381 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:52:41,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1381 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2025-01-09 03:52:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 3082. [2025-01-09 03:52:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 2517 states have (on average 1.6491855383392928) internal successors, (4151), 2523 states have internal predecessors, (4151), 530 states have call successors, (530), 32 states have call predecessors, (530), 34 states have return successors, (577), 528 states have call predecessors, (577), 529 states have call successors, (577) [2025-01-09 03:52:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 5258 transitions. [2025-01-09 03:52:41,459 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 5258 transitions. Word has length 191 [2025-01-09 03:52:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:41,459 INFO L471 AbstractCegarLoop]: Abstraction has 3082 states and 5258 transitions. [2025-01-09 03:52:41,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 5258 transitions. [2025-01-09 03:52:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 03:52:41,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:41,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:52:41,473 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1808494389, now seen corresponding path program 1 times [2025-01-09 03:52:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:41,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619494939] [2025-01-09 03:52:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:41,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 03:52:41,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 03:52:41,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:41,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:41,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619494939] [2025-01-09 03:52:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619494939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:41,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:41,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156010853] [2025-01-09 03:52:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:41,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:41,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:41,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:41,527 INFO L87 Difference]: Start difference. First operand 3082 states and 5258 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:41,626 INFO L93 Difference]: Finished difference Result 7354 states and 12644 transitions. [2025-01-09 03:52:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:41,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-01-09 03:52:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:41,649 INFO L225 Difference]: With dead ends: 7354 [2025-01-09 03:52:41,649 INFO L226 Difference]: Without dead ends: 4747 [2025-01-09 03:52:41,659 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:52:41,660 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 133 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1381 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:52:41,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1381 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2025-01-09 03:52:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 4739. [2025-01-09 03:52:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4739 states, 3929 states have (on average 1.6569101552557903) internal successors, (6510), 3935 states have internal predecessors, (6510), 775 states have call successors, (775), 32 states have call predecessors, (775), 34 states have return successors, (848), 773 states have call predecessors, (848), 774 states have call successors, (848) [2025-01-09 03:52:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4739 states to 4739 states and 8133 transitions. [2025-01-09 03:52:41,953 INFO L78 Accepts]: Start accepts. Automaton has 4739 states and 8133 transitions. Word has length 192 [2025-01-09 03:52:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:41,953 INFO L471 AbstractCegarLoop]: Abstraction has 4739 states and 8133 transitions. [2025-01-09 03:52:41,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4739 states and 8133 transitions. [2025-01-09 03:52:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 03:52:41,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:41,973 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:41,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:52:41,973 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:41,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1209121153, now seen corresponding path program 1 times [2025-01-09 03:52:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757285270] [2025-01-09 03:52:41,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:41,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 03:52:42,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 03:52:42,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:42,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:42,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:42,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757285270] [2025-01-09 03:52:42,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757285270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:42,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:42,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:42,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397336521] [2025-01-09 03:52:42,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:42,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:42,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:42,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:42,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:42,038 INFO L87 Difference]: Start difference. First operand 4739 states and 8133 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:42,190 INFO L93 Difference]: Finished difference Result 11478 states and 19844 transitions. [2025-01-09 03:52:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:42,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2025-01-09 03:52:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:42,232 INFO L225 Difference]: With dead ends: 11478 [2025-01-09 03:52:42,232 INFO L226 Difference]: Without dead ends: 7535 [2025-01-09 03:52:42,246 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:52:42,247 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 131 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1394 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:52:42,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1394 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7535 states. [2025-01-09 03:52:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7535 to 7527. [2025-01-09 03:52:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7527 states, 6224 states have (on average 1.657133676092545) internal successors, (10314), 6230 states have internal predecessors, (10314), 1268 states have call successors, (1268), 32 states have call predecessors, (1268), 34 states have return successors, (1385), 1266 states have call predecessors, (1385), 1267 states have call successors, (1385) [2025-01-09 03:52:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7527 states to 7527 states and 12967 transitions. [2025-01-09 03:52:42,546 INFO L78 Accepts]: Start accepts. Automaton has 7527 states and 12967 transitions. Word has length 193 [2025-01-09 03:52:42,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:42,547 INFO L471 AbstractCegarLoop]: Abstraction has 7527 states and 12967 transitions. [2025-01-09 03:52:42,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7527 states and 12967 transitions. [2025-01-09 03:52:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 03:52:42,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:42,577 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:42,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:52:42,578 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:42,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2084824879, now seen corresponding path program 1 times [2025-01-09 03:52:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864258439] [2025-01-09 03:52:42,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:42,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:42,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 03:52:42,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 03:52:42,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:42,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:42,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:42,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864258439] [2025-01-09 03:52:42,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864258439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:42,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:42,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:42,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650282931] [2025-01-09 03:52:42,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:42,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:42,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:42,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:42,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:42,634 INFO L87 Difference]: Start difference. First operand 7527 states and 12967 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:42,885 INFO L93 Difference]: Finished difference Result 18960 states and 32876 transitions. [2025-01-09 03:52:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:42,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 194 [2025-01-09 03:52:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:42,931 INFO L225 Difference]: With dead ends: 18960 [2025-01-09 03:52:42,931 INFO L226 Difference]: Without dead ends: 12615 [2025-01-09 03:52:42,952 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:52:42,952 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 129 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1386 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:52:42,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1386 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12615 states. [2025-01-09 03:52:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12615 to 12607. [2025-01-09 03:52:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12607 states, 10482 states have (on average 1.6583667239076512) internal successors, (17383), 10488 states have internal predecessors, (17383), 2090 states have call successors, (2090), 32 states have call predecessors, (2090), 34 states have return successors, (2285), 2088 states have call predecessors, (2285), 2089 states have call successors, (2285) [2025-01-09 03:52:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12607 states to 12607 states and 21758 transitions. [2025-01-09 03:52:43,505 INFO L78 Accepts]: Start accepts. Automaton has 12607 states and 21758 transitions. Word has length 194 [2025-01-09 03:52:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:43,505 INFO L471 AbstractCegarLoop]: Abstraction has 12607 states and 21758 transitions. [2025-01-09 03:52:43,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 12607 states and 21758 transitions. [2025-01-09 03:52:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 03:52:43,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:43,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:43,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:52:43,549 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:43,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:43,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1639781440, now seen corresponding path program 1 times [2025-01-09 03:52:43,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093046266] [2025-01-09 03:52:43,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:43,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:43,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 03:52:43,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 03:52:43,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:43,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:43,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:43,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093046266] [2025-01-09 03:52:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093046266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:43,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:43,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549524848] [2025-01-09 03:52:43,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:43,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:43,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:43,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:43,613 INFO L87 Difference]: Start difference. First operand 12607 states and 21758 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:44,069 INFO L93 Difference]: Finished difference Result 30205 states and 52057 transitions. [2025-01-09 03:52:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 176 [2025-01-09 03:52:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:44,134 INFO L225 Difference]: With dead ends: 30205 [2025-01-09 03:52:44,135 INFO L226 Difference]: Without dead ends: 19762 [2025-01-09 03:52:44,168 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:52:44,169 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 127 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1366 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:52:44,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1366 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2025-01-09 03:52:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 19754. [2025-01-09 03:52:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19754 states, 16426 states have (on average 1.6353951053208329) internal successors, (26863), 16432 states have internal predecessors, (26863), 3293 states have call successors, (3293), 32 states have call predecessors, (3293), 34 states have return successors, (3632), 3291 states have call predecessors, (3632), 3292 states have call successors, (3632) [2025-01-09 03:52:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19754 states to 19754 states and 33788 transitions. [2025-01-09 03:52:44,810 INFO L78 Accepts]: Start accepts. Automaton has 19754 states and 33788 transitions. Word has length 176 [2025-01-09 03:52:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:44,811 INFO L471 AbstractCegarLoop]: Abstraction has 19754 states and 33788 transitions. [2025-01-09 03:52:44,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:44,811 INFO L276 IsEmpty]: Start isEmpty. Operand 19754 states and 33788 transitions. [2025-01-09 03:52:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 03:52:44,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:44,872 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 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:52:44,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:52:44,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:44,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1898333968, now seen corresponding path program 1 times [2025-01-09 03:52:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724712538] [2025-01-09 03:52:44,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:44,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 03:52:44,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 03:52:44,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:44,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:44,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724712538] [2025-01-09 03:52:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724712538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:44,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:44,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455909665] [2025-01-09 03:52:44,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:44,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:44,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:44,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:44,926 INFO L87 Difference]: Start difference. First operand 19754 states and 33788 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:45,827 INFO L93 Difference]: Finished difference Result 52207 states and 89611 transitions. [2025-01-09 03:52:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:45,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 196 [2025-01-09 03:52:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:45,970 INFO L225 Difference]: With dead ends: 52207 [2025-01-09 03:52:45,971 INFO L226 Difference]: Without dead ends: 35265 [2025-01-09 03:52:46,018 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:52:46,018 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 125 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1384 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:52:46,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35265 states. [2025-01-09 03:52:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35265 to 35257. [2025-01-09 03:52:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35257 states, 29479 states have (on average 1.6324162963465518) internal successors, (48122), 29485 states have internal predecessors, (48122), 5743 states have call successors, (5743), 32 states have call predecessors, (5743), 34 states have return successors, (6356), 5741 states have call predecessors, (6356), 5742 states have call successors, (6356) [2025-01-09 03:52:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35257 states to 35257 states and 60221 transitions. [2025-01-09 03:52:47,459 INFO L78 Accepts]: Start accepts. Automaton has 35257 states and 60221 transitions. Word has length 196 [2025-01-09 03:52:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:47,460 INFO L471 AbstractCegarLoop]: Abstraction has 35257 states and 60221 transitions. [2025-01-09 03:52:47,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 35257 states and 60221 transitions. [2025-01-09 03:52:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 03:52:47,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:47,525 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 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:52:47,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:52:47,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:47,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1733506631, now seen corresponding path program 1 times [2025-01-09 03:52:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160425913] [2025-01-09 03:52:47,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:47,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 03:52:47,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 03:52:47,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:47,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:47,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:47,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160425913] [2025-01-09 03:52:47,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160425913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:47,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:47,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:47,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289561265] [2025-01-09 03:52:47,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:47,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:47,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:47,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:47,584 INFO L87 Difference]: Start difference. First operand 35257 states and 60221 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:48,829 INFO L93 Difference]: Finished difference Result 96219 states and 164803 transitions. [2025-01-09 03:52:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:48,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-01-09 03:52:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:49,105 INFO L225 Difference]: With dead ends: 96219 [2025-01-09 03:52:49,105 INFO L226 Difference]: Without dead ends: 64693 [2025-01-09 03:52:49,198 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:52:49,198 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 123 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1386 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:52:49,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1386 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64693 states. [2025-01-09 03:52:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64693 to 64685. [2025-01-09 03:52:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64685 states, 54394 states have (on average 1.6282310548957606) internal successors, (88566), 54400 states have internal predecessors, (88566), 10256 states have call successors, (10256), 32 states have call predecessors, (10256), 34 states have return successors, (11401), 10254 states have call predecessors, (11401), 10255 states have call successors, (11401) [2025-01-09 03:52:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64685 states to 64685 states and 110223 transitions. [2025-01-09 03:52:51,994 INFO L78 Accepts]: Start accepts. Automaton has 64685 states and 110223 transitions. Word has length 197 [2025-01-09 03:52:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:51,995 INFO L471 AbstractCegarLoop]: Abstraction has 64685 states and 110223 transitions. [2025-01-09 03:52:51,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 64685 states and 110223 transitions. [2025-01-09 03:52:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 03:52:52,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:52,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 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:52:52,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:52:52,132 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:52,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1716639280, now seen corresponding path program 1 times [2025-01-09 03:52:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334219267] [2025-01-09 03:52:52,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:52,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:52,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 03:52:52,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 03:52:52,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:52,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:52,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:52,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334219267] [2025-01-09 03:52:52,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334219267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:52,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:52,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031072138] [2025-01-09 03:52:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:52,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:52,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:52,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:52,209 INFO L87 Difference]: Start difference. First operand 64685 states and 110223 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:54,591 INFO L93 Difference]: Finished difference Result 121361 states and 207148 transitions. [2025-01-09 03:52:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:54,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 198 [2025-01-09 03:52:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:55,036 INFO L225 Difference]: With dead ends: 121361 [2025-01-09 03:52:55,037 INFO L226 Difference]: Without dead ends: 121093 [2025-01-09 03:52:55,094 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:52:55,096 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 118 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1390 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:52:55,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1390 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121093 states. [2025-01-09 03:52:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121093 to 121085. [2025-01-09 03:52:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121085 states, 102426 states have (on average 1.6229277722453284) internal successors, (166230), 102432 states have internal predecessors, (166230), 18624 states have call successors, (18624), 32 states have call predecessors, (18624), 34 states have return successors, (20815), 18622 states have call predecessors, (20815), 18623 states have call successors, (20815) [2025-01-09 03:52:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121085 states to 121085 states and 205669 transitions. [2025-01-09 03:52:59,521 INFO L78 Accepts]: Start accepts. Automaton has 121085 states and 205669 transitions. Word has length 198 [2025-01-09 03:52:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:59,522 INFO L471 AbstractCegarLoop]: Abstraction has 121085 states and 205669 transitions. [2025-01-09 03:52:59,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 121085 states and 205669 transitions. [2025-01-09 03:52:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 03:52:59,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:59,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 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:52:59,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:52:59,720 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:59,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1360528646, now seen corresponding path program 1 times [2025-01-09 03:52:59,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:59,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707562763] [2025-01-09 03:52:59,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:59,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:59,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 03:52:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 03:52:59,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:59,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:59,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707562763] [2025-01-09 03:52:59,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707562763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:59,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:59,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:52:59,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561390373] [2025-01-09 03:52:59,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:59,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:52:59,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:59,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:52:59,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:59,881 INFO L87 Difference]: Start difference. First operand 121085 states and 205669 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:53:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:04,665 INFO L93 Difference]: Finished difference Result 232913 states and 397126 transitions. [2025-01-09 03:53:04,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:53:04,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 199 [2025-01-09 03:53:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:05,491 INFO L225 Difference]: With dead ends: 232913 [2025-01-09 03:53:05,491 INFO L226 Difference]: Without dead ends: 232653 [2025-01-09 03:53:05,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:05,580 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 642 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 3509 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:05,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 3509 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:53:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232653 states.