./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product27.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_product27.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4373ae32f100aa418b32a7018bfdec5c3f7ae719a7f9b296410b14fba54a4baf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:34:15,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:34:15,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:34:15,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:34:15,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:34:15,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:34:15,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:34:15,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:34:15,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:34:15,723 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:34:15,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:34:15,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:34:15,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:34:15,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:34:15,725 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:34:15,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:34:15,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:34:15,725 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:34:15,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:34:15,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:34:15,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:34:15,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:34:15,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:34:15,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:34:15,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:34:15,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:34:15,726 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:34:15,726 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:34:15,726 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:34:15,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:34:15,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:34:15,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:34:15,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:34:15,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:34:15,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:34:15,728 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/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 -> 4373ae32f100aa418b32a7018bfdec5c3f7ae719a7f9b296410b14fba54a4baf [2025-03-08 05:34:15,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:34:16,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:34:16,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:34:16,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:34:16,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:34:16,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product27.cil.c [2025-03-08 05:34:17,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7810d9316/46859857e0a64b1e84ac30c0bdfbd01d/FLAGc16147e6e [2025-03-08 05:34:17,597 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:34:17,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product27.cil.c [2025-03-08 05:34:17,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7810d9316/46859857e0a64b1e84ac30c0bdfbd01d/FLAGc16147e6e [2025-03-08 05:34:17,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7810d9316/46859857e0a64b1e84ac30c0bdfbd01d [2025-03-08 05:34:17,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:34:17,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:34:17,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:34:17,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:34:17,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:34:17,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:34:17" (1/1) ... [2025-03-08 05:34:17,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ca222e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:17, skipping insertion in model container [2025-03-08 05:34:17,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:34:17" (1/1) ... [2025-03-08 05:34:17,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:34:17,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product27.cil.c[1542,1555] [2025-03-08 05:34:18,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:34:18,286 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:34:18,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-08 05:34:18,293 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [57] [2025-03-08 05:34:18,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [75] [2025-03-08 05:34:18,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [308] [2025-03-08 05:34:18,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [357] [2025-03-08 05:34:18,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1437] [2025-03-08 05:34:18,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1849] [2025-03-08 05:34:18,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1948] [2025-03-08 05:34:18,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2314] [2025-03-08 05:34:18,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2619] [2025-03-08 05:34:18,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2985] [2025-03-08 05:34:18,298 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product27.cil.c[1542,1555] [2025-03-08 05:34:18,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:34:18,407 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:34:18,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18 WrapperNode [2025-03-08 05:34:18,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:34:18,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:34:18,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:34:18,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:34:18,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,470 INFO L138 Inliner]: procedures = 133, calls = 208, calls flagged for inlining = 64, calls inlined = 61, statements flattened = 1113 [2025-03-08 05:34:18,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:34:18,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:34:18,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:34:18,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:34:18,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,511 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-03-08 05:34:18,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:34:18,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:34:18,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:34:18,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:34:18,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (1/1) ... [2025-03-08 05:34:18,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:34:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:18,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:34:18,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:34:18,611 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:34:18,611 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:34:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:34:18,612 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:34:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:34:18,612 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:34:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:34:18,612 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:34:18,612 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:34:18,613 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:34:18,613 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:34:18,613 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:34:18,613 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:34:18,613 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:34:18,613 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:34:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:34:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:34:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:34:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:34:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:34:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:34:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:34:18,614 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:34:18,614 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:34:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:34:18,615 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:34:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:34:18,615 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:34:18,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:34:18,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:34:18,816 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:34:18,820 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:34:18,908 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1756: #res := ~retValue_acc~28; [2025-03-08 05:34:18,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1026-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~13#1; [2025-03-08 05:34:18,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071: #res#1 := ~retValue_acc~14#1; [2025-03-08 05:34:18,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: #res := ~retValue_acc~12; [2025-03-08 05:34:18,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1945-1: createEmail_#res#1 := createEmail_~retValue_acc~33#1; [2025-03-08 05:34:18,970 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: #res := ~retValue_acc~6; [2025-03-08 05:34:19,037 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1793: #res := ~retValue_acc~29; [2025-03-08 05:34:19,069 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: #res := ~retValue_acc~23; [2025-03-08 05:34:19,115 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L849: #res := ~retValue_acc~10; [2025-03-08 05:34:19,260 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2869-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-03-08 05:34:19,260 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1367-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~18#1; [2025-03-08 05:34:19,260 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-1: isVerified_#res#1 := isVerified_~retValue_acc~30#1; [2025-03-08 05:34:19,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1493-1: getEmailId_#res#1 := getEmailId_~retValue_acc~21#1; [2025-03-08 05:34:19,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~17#1; [2025-03-08 05:34:19,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~11#1; [2025-03-08 05:34:19,261 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414-1: getClientId_#res#1 := getClientId_~retValue_acc~19#1; [2025-03-08 05:34:19,511 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~16#1; [2025-03-08 05:34:19,512 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-08 05:34:19,512 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L354-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-03-08 05:34:19,512 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2835-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-08 05:34:19,512 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1134-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~15#1; [2025-03-08 05:34:19,512 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-08 05:34:19,517 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1530: #res := ~retValue_acc~22; [2025-03-08 05:34:19,519 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: #res := ~retValue_acc~31; [2025-03-08 05:34:19,669 INFO L? ?]: Removed 565 outVars from TransFormulas that were not future-live. [2025-03-08 05:34:19,670 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:34:19,690 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:34:19,690 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:34:19,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:34:19 BoogieIcfgContainer [2025-03-08 05:34:19,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:34:19,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:34:19,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:34:19,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:34:19,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:34:17" (1/3) ... [2025-03-08 05:34:19,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47df76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:34:19, skipping insertion in model container [2025-03-08 05:34:19,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:18" (2/3) ... [2025-03-08 05:34:19,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47df76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:34:19, skipping insertion in model container [2025-03-08 05:34:19,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:34:19" (3/3) ... [2025-03-08 05:34:19,702 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product27.cil.c [2025-03-08 05:34:19,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:34:19,718 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product27.cil.c that has 24 procedures, 403 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:34:19,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:34:19,786 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;@d051baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:34:19,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:34:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 403 states, 318 states have (on average 1.5628930817610063) internal successors, (497), 321 states have internal predecessors, (497), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 05:34:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:34:19,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:19,809 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:19,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:19,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1436101147, now seen corresponding path program 1 times [2025-03-08 05:34:19,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844799007] [2025-03-08 05:34:19,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:19,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:19,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:34:19,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:34:19,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:19,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:34:20,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844799007] [2025-03-08 05:34:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844799007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:20,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463399147] [2025-03-08 05:34:20,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:20,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:20,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:20,394 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:20,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:34:20,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:34:20,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:34:20,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:20,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:20,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:34:20,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:34:20,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463399147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:20,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:20,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:34:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460634895] [2025-03-08 05:34:20,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:20,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:20,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:20,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:34:20,776 INFO L87 Difference]: Start difference. First operand has 403 states, 318 states have (on average 1.5628930817610063) internal successors, (497), 321 states have internal predecessors, (497), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:20,853 INFO L93 Difference]: Finished difference Result 611 states and 922 transitions. [2025-03-08 05:34:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:20,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-03-08 05:34:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:20,870 INFO L225 Difference]: With dead ends: 611 [2025-03-08 05:34:20,871 INFO L226 Difference]: Without dead ends: 397 [2025-03-08 05:34:20,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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-03-08 05:34:20,877 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 0 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1223 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-03-08 05:34:20,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1223 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-08 05:34:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-08 05:34:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 313 states have (on average 1.5591054313099042) internal successors, (488), 315 states have internal predecessors, (488), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 05:34:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 607 transitions. [2025-03-08 05:34:20,940 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 607 transitions. Word has length 101 [2025-03-08 05:34:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:20,942 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 607 transitions. [2025-03-08 05:34:20,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 607 transitions. [2025-03-08 05:34:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:34:20,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:20,950 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:20,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:34:21,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:34:21,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:21,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash -734489864, now seen corresponding path program 1 times [2025-03-08 05:34:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:21,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586519048] [2025-03-08 05:34:21,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:21,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:34:21,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:34:21,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:21,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:21,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586519048] [2025-03-08 05:34:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586519048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:21,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634359236] [2025-03-08 05:34:21,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:21,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:21,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:21,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:21,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:34:21,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:34:21,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:34:21,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:21,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:21,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:34:21,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:34:21,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634359236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:21,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:34:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400715194] [2025-03-08 05:34:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:21,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:21,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:21,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:34:21,719 INFO L87 Difference]: Start difference. First operand 397 states and 607 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:21,763 INFO L93 Difference]: Finished difference Result 846 states and 1313 transitions. [2025-03-08 05:34:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:21,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-03-08 05:34:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:21,769 INFO L225 Difference]: With dead ends: 846 [2025-03-08 05:34:21,769 INFO L226 Difference]: Without dead ends: 475 [2025-03-08 05:34:21,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 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-03-08 05:34:21,771 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 142 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1167 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-03-08 05:34:21,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-08 05:34:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 467. [2025-03-08 05:34:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 369 states have (on average 1.5799457994579946) internal successors, (583), 371 states have internal predecessors, (583), 74 states have call successors, (74), 23 states have call predecessors, (74), 23 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 05:34:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 730 transitions. [2025-03-08 05:34:21,817 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 730 transitions. Word has length 108 [2025-03-08 05:34:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:21,819 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 730 transitions. [2025-03-08 05:34:21,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 730 transitions. [2025-03-08 05:34:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:34:21,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:21,822 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:21,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:34:22,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:34:22,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:22,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:22,023 INFO L85 PathProgramCache]: Analyzing trace with hash -105457604, now seen corresponding path program 1 times [2025-03-08 05:34:22,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:22,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472147504] [2025-03-08 05:34:22,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:22,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:22,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:34:22,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:34:22,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:22,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:22,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:22,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472147504] [2025-03-08 05:34:22,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472147504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:22,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25132047] [2025-03-08 05:34:22,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:22,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:22,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:22,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:34:22,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:34:22,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:34:22,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:22,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:22,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:34:22,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:34:22,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:22,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25132047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:22,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:22,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:34:22,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735021650] [2025-03-08 05:34:22,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:22,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:22,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:22,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:22,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:22,565 INFO L87 Difference]: Start difference. First operand 467 states and 730 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:34:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:22,638 INFO L93 Difference]: Finished difference Result 925 states and 1450 transitions. [2025-03-08 05:34:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2025-03-08 05:34:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:22,642 INFO L225 Difference]: With dead ends: 925 [2025-03-08 05:34:22,642 INFO L226 Difference]: Without dead ends: 469 [2025-03-08 05:34:22,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 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-03-08 05:34:22,648 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 2 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2381 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-03-08 05:34:22,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2381 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-08 05:34:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2025-03-08 05:34:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 370 states have (on average 1.5783783783783785) internal successors, (584), 373 states have internal predecessors, (584), 74 states have call successors, (74), 23 states have call predecessors, (74), 24 states have return successors, (75), 72 states have call predecessors, (75), 73 states have call successors, (75) [2025-03-08 05:34:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 733 transitions. [2025-03-08 05:34:22,671 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 733 transitions. Word has length 109 [2025-03-08 05:34:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:22,671 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 733 transitions. [2025-03-08 05:34:22,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:34:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 733 transitions. [2025-03-08 05:34:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:34:22,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:22,673 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:22,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:34:22,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:22,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2061368327, now seen corresponding path program 1 times [2025-03-08 05:34:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424467251] [2025-03-08 05:34:22,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:22,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:34:22,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:34:22,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:22,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:34:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424467251] [2025-03-08 05:34:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424467251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013085187] [2025-03-08 05:34:23,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:23,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:23,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:23,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:23,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:34:23,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:34:23,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:34:23,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:23,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:23,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:34:23,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:34:23,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013085187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:23,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:23,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:34:23,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389796344] [2025-03-08 05:34:23,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:23,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:23,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:23,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:23,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:34:23,306 INFO L87 Difference]: Start difference. First operand 469 states and 733 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:34:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:23,358 INFO L93 Difference]: Finished difference Result 927 states and 1455 transitions. [2025-03-08 05:34:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:23,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-08 05:34:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:23,361 INFO L225 Difference]: With dead ends: 927 [2025-03-08 05:34:23,362 INFO L226 Difference]: Without dead ends: 471 [2025-03-08 05:34:23,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 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-03-08 05:34:23,363 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 2 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2367 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-03-08 05:34:23,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2367 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-08 05:34:23,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-08 05:34:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 371 states have (on average 1.5768194070080863) internal successors, (585), 375 states have internal predecessors, (585), 74 states have call successors, (74), 23 states have call predecessors, (74), 25 states have return successors, (80), 72 states have call predecessors, (80), 73 states have call successors, (80) [2025-03-08 05:34:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 739 transitions. [2025-03-08 05:34:23,383 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 739 transitions. Word has length 110 [2025-03-08 05:34:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:23,383 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 739 transitions. [2025-03-08 05:34:23,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:34:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 739 transitions. [2025-03-08 05:34:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 05:34:23,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:23,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:23,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:34:23,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:23,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:23,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:23,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1148360031, now seen corresponding path program 1 times [2025-03-08 05:34:23,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825997495] [2025-03-08 05:34:23,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:23,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 05:34:23,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 05:34:23,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:23,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825997495] [2025-03-08 05:34:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825997495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:23,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:23,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:34:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652496895] [2025-03-08 05:34:23,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:23,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:23,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:23,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:23,701 INFO L87 Difference]: Start difference. First operand 471 states and 739 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:34:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:23,736 INFO L93 Difference]: Finished difference Result 919 states and 1446 transitions. [2025-03-08 05:34:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-08 05:34:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:23,739 INFO L225 Difference]: With dead ends: 919 [2025-03-08 05:34:23,740 INFO L226 Difference]: Without dead ends: 471 [2025-03-08 05:34:23,741 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-03-08 05:34:23,742 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2385 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-03-08 05:34:23,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2385 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-08 05:34:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-08 05:34:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 371 states have (on average 1.5768194070080863) internal successors, (585), 375 states have internal predecessors, (585), 74 states have call successors, (74), 23 states have call predecessors, (74), 25 states have return successors, (79), 72 states have call predecessors, (79), 73 states have call successors, (79) [2025-03-08 05:34:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 738 transitions. [2025-03-08 05:34:23,760 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 738 transitions. Word has length 111 [2025-03-08 05:34:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:23,760 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 738 transitions. [2025-03-08 05:34:23,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:34:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 738 transitions. [2025-03-08 05:34:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:34:23,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:23,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:34:23,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1465096000, now seen corresponding path program 2 times [2025-03-08 05:34:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:23,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172372987] [2025-03-08 05:34:23,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:34:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:23,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-08 05:34:23,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 112 statements. [2025-03-08 05:34:23,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:34:23,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:34:23,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:23,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172372987] [2025-03-08 05:34:23,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172372987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:23,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:23,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491049345] [2025-03-08 05:34:23,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:23,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:23,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:23,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:23,938 INFO L87 Difference]: Start difference. First operand 471 states and 738 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:24,292 INFO L93 Difference]: Finished difference Result 951 states and 1498 transitions. [2025-03-08 05:34:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:34:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2025-03-08 05:34:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:24,298 INFO L225 Difference]: With dead ends: 951 [2025-03-08 05:34:24,298 INFO L226 Difference]: Without dead ends: 947 [2025-03-08 05:34:24,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:34:24,299 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 1030 mSDsluCounter, 2928 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:24,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 3548 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:34:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-08 05:34:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 937. [2025-03-08 05:34:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 740 states have (on average 1.5810810810810811) internal successors, (1170), 745 states have internal predecessors, (1170), 146 states have call successors, (146), 47 states have call predecessors, (146), 50 states have return successors, (160), 144 states have call predecessors, (160), 144 states have call successors, (160) [2025-03-08 05:34:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1476 transitions. [2025-03-08 05:34:24,347 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1476 transitions. Word has length 112 [2025-03-08 05:34:24,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:24,348 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1476 transitions. [2025-03-08 05:34:24,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:24,348 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1476 transitions. [2025-03-08 05:34:24,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 05:34:24,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:24,351 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:24,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:34:24,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:24,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1158276892, now seen corresponding path program 1 times [2025-03-08 05:34:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589753216] [2025-03-08 05:34:24,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:24,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 05:34:24,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 05:34:24,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:24,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589753216] [2025-03-08 05:34:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589753216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:34:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181936940] [2025-03-08 05:34:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:24,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:24,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:24,466 INFO L87 Difference]: Start difference. First operand 937 states and 1476 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:34:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:24,520 INFO L93 Difference]: Finished difference Result 1843 states and 2912 transitions. [2025-03-08 05:34:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:24,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-03-08 05:34:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:24,529 INFO L225 Difference]: With dead ends: 1843 [2025-03-08 05:34:24,529 INFO L226 Difference]: Without dead ends: 941 [2025-03-08 05:34:24,532 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-03-08 05:34:24,532 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2388 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-03-08 05:34:24,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2388 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-03-08 05:34:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2025-03-08 05:34:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 742 states have (on average 1.5795148247978437) internal successors, (1172), 749 states have internal predecessors, (1172), 146 states have call successors, (146), 47 states have call predecessors, (146), 52 states have return successors, (163), 144 states have call predecessors, (163), 144 states have call successors, (163) [2025-03-08 05:34:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1481 transitions. [2025-03-08 05:34:24,565 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1481 transitions. Word has length 113 [2025-03-08 05:34:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:24,566 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1481 transitions. [2025-03-08 05:34:24,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:34:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1481 transitions. [2025-03-08 05:34:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:34:24,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:24,569 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:24,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:34:24,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:24,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1896965784, now seen corresponding path program 1 times [2025-03-08 05:34:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:24,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468509547] [2025-03-08 05:34:24,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:24,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:24,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:34:24,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:34:24,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:24,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:34:24,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:24,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468509547] [2025-03-08 05:34:24,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468509547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:24,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:24,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:24,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145710110] [2025-03-08 05:34:24,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:24,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:24,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:24,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:24,681 INFO L87 Difference]: Start difference. First operand 941 states and 1481 transitions. Second operand has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:34:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:24,794 INFO L93 Difference]: Finished difference Result 1842 states and 2905 transitions. [2025-03-08 05:34:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:34:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 114 [2025-03-08 05:34:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:24,802 INFO L225 Difference]: With dead ends: 1842 [2025-03-08 05:34:24,802 INFO L226 Difference]: Without dead ends: 945 [2025-03-08 05:34:24,806 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-03-08 05:34:24,807 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 7 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4101 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:24,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4101 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:34:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-08 05:34:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 943. [2025-03-08 05:34:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 744 states have (on average 1.5779569892473118) internal successors, (1174), 750 states have internal predecessors, (1174), 146 states have call successors, (146), 48 states have call predecessors, (146), 52 states have return successors, (161), 144 states have call predecessors, (161), 144 states have call successors, (161) [2025-03-08 05:34:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1481 transitions. [2025-03-08 05:34:24,877 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1481 transitions. Word has length 114 [2025-03-08 05:34:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:24,878 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1481 transitions. [2025-03-08 05:34:24,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:34:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1481 transitions. [2025-03-08 05:34:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:34:24,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:24,881 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:24,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:34:24,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:24,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1788222742, now seen corresponding path program 2 times [2025-03-08 05:34:24,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:24,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360349816] [2025-03-08 05:34:24,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:34:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:24,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-08 05:34:24,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 115 statements. [2025-03-08 05:34:24,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:34:24,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 05:34:24,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:24,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360349816] [2025-03-08 05:34:24,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360349816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:24,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:24,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:24,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749500293] [2025-03-08 05:34:24,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:24,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:24,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:24,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:24,997 INFO L87 Difference]: Start difference. First operand 943 states and 1481 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:25,364 INFO L93 Difference]: Finished difference Result 1911 states and 3021 transitions. [2025-03-08 05:34:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:34:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-08 05:34:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:25,377 INFO L225 Difference]: With dead ends: 1911 [2025-03-08 05:34:25,377 INFO L226 Difference]: Without dead ends: 1905 [2025-03-08 05:34:25,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:34:25,379 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 1022 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:25,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 3572 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:34:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2025-03-08 05:34:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1883. [2025-03-08 05:34:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1486 states have (on average 1.5794078061911172) internal successors, (2347), 1500 states have internal predecessors, (2347), 288 states have call successors, (288), 96 states have call predecessors, (288), 108 states have return successors, (344), 286 states have call predecessors, (344), 284 states have call successors, (344) [2025-03-08 05:34:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2979 transitions. [2025-03-08 05:34:25,463 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2979 transitions. Word has length 115 [2025-03-08 05:34:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:25,463 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 2979 transitions. [2025-03-08 05:34:25,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2979 transitions. [2025-03-08 05:34:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:34:25,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:25,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:25,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:34:25,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:25,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1166727412, now seen corresponding path program 1 times [2025-03-08 05:34:25,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:25,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741869591] [2025-03-08 05:34:25,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:25,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:25,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:34:25,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:34:25,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:25,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:34:25,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741869591] [2025-03-08 05:34:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741869591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651761484] [2025-03-08 05:34:25,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:25,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:25,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:34:25,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:34:25,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:34:25,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:25,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:25,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:34:25,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:34:25,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:25,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651761484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:25,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:25,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:34:25,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002765073] [2025-03-08 05:34:25,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:25,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:25,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:25,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:25,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:25,858 INFO L87 Difference]: Start difference. First operand 1883 states and 2979 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:25,944 INFO L93 Difference]: Finished difference Result 2837 states and 4480 transitions. [2025-03-08 05:34:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:25,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-08 05:34:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:25,981 INFO L225 Difference]: With dead ends: 2837 [2025-03-08 05:34:25,981 INFO L226 Difference]: Without dead ends: 1887 [2025-03-08 05:34:25,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 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-03-08 05:34:25,984 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:25,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2378 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2025-03-08 05:34:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1879. [2025-03-08 05:34:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1484 states have (on average 1.5795148247978437) internal successors, (2344), 1498 states have internal predecessors, (2344), 286 states have call successors, (286), 96 states have call predecessors, (286), 108 states have return successors, (342), 284 states have call predecessors, (342), 282 states have call successors, (342) [2025-03-08 05:34:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 2972 transitions. [2025-03-08 05:34:26,045 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 2972 transitions. Word has length 115 [2025-03-08 05:34:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:26,045 INFO L471 AbstractCegarLoop]: Abstraction has 1879 states and 2972 transitions. [2025-03-08 05:34:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2972 transitions. [2025-03-08 05:34:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:34:26,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:26,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:26,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:26,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:34:26,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1480531875, now seen corresponding path program 1 times [2025-03-08 05:34:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:26,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006199438] [2025-03-08 05:34:26,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:26,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:26,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:34:26,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:34:26,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:26,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:34:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:26,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006199438] [2025-03-08 05:34:26,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006199438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:26,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:26,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:26,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865938599] [2025-03-08 05:34:26,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:26,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:26,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:26,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:26,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:26,411 INFO L87 Difference]: Start difference. First operand 1879 states and 2972 transitions. Second operand has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:34:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:26,649 INFO L93 Difference]: Finished difference Result 3699 states and 5860 transitions. [2025-03-08 05:34:26,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:34:26,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2025-03-08 05:34:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:26,662 INFO L225 Difference]: With dead ends: 3699 [2025-03-08 05:34:26,663 INFO L226 Difference]: Without dead ends: 1887 [2025-03-08 05:34:26,670 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-03-08 05:34:26,671 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 5 mSDsluCounter, 3523 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4115 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:26,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4115 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:34:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2025-03-08 05:34:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1883. [2025-03-08 05:34:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1488 states have (on average 1.5779569892473118) internal successors, (2348), 1501 states have internal predecessors, (2348), 286 states have call successors, (286), 97 states have call predecessors, (286), 108 states have return successors, (338), 284 states have call predecessors, (338), 282 states have call successors, (338) [2025-03-08 05:34:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2972 transitions. [2025-03-08 05:34:26,761 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2972 transitions. Word has length 116 [2025-03-08 05:34:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 2972 transitions. [2025-03-08 05:34:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-08 05:34:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2972 transitions. [2025-03-08 05:34:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:34:26,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:26,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:26,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:34:26,769 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:26,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:26,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1785060508, now seen corresponding path program 1 times [2025-03-08 05:34:26,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:26,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321996562] [2025-03-08 05:34:26,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:26,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:34:26,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:34:26,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:26,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:26,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321996562] [2025-03-08 05:34:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321996562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:26,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815509323] [2025-03-08 05:34:26,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:26,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:26,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:26,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:34:27,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:34:27,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:34:27,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:27,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:27,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:34:27,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:27,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:34:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815509323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:34:27,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:34:27,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:34:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105494525] [2025-03-08 05:34:27,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:34:27,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:34:27,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:27,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:34:27,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:34:27,374 INFO L87 Difference]: Start difference. First operand 1883 states and 2972 transitions. Second operand has 11 states, 10 states have (on average 12.0) internal successors, (120), 11 states have internal predecessors, (120), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 05:34:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:28,082 INFO L93 Difference]: Finished difference Result 5513 states and 9096 transitions. [2025-03-08 05:34:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:34:28,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.0) internal successors, (120), 11 states have internal predecessors, (120), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 117 [2025-03-08 05:34:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:28,106 INFO L225 Difference]: With dead ends: 5513 [2025-03-08 05:34:28,106 INFO L226 Difference]: Without dead ends: 3709 [2025-03-08 05:34:28,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 231 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-03-08 05:34:28,115 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1316 mSDsluCounter, 4265 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 4871 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:28,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 4871 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:34:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2025-03-08 05:34:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3613. [2025-03-08 05:34:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 2902 states have (on average 1.6299104066161267) internal successors, (4730), 2914 states have internal predecessors, (4730), 602 states have call successors, (602), 98 states have call predecessors, (602), 108 states have return successors, (734), 600 states have call predecessors, (734), 598 states have call successors, (734) [2025-03-08 05:34:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 6066 transitions. [2025-03-08 05:34:28,266 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 6066 transitions. Word has length 117 [2025-03-08 05:34:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:28,267 INFO L471 AbstractCegarLoop]: Abstraction has 3613 states and 6066 transitions. [2025-03-08 05:34:28,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.0) internal successors, (120), 11 states have internal predecessors, (120), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-08 05:34:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 6066 transitions. [2025-03-08 05:34:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:34:28,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:28,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:28,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:34:28,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:28,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:28,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:28,484 INFO L85 PathProgramCache]: Analyzing trace with hash -996858776, now seen corresponding path program 1 times [2025-03-08 05:34:28,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:28,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156808304] [2025-03-08 05:34:28,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:28,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:34:28,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:34:28,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:28,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:28,566 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:28,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:28,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156808304] [2025-03-08 05:34:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156808304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:28,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907316677] [2025-03-08 05:34:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:28,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:28,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:28,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:28,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:28,568 INFO L87 Difference]: Start difference. First operand 3613 states and 6066 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:28,732 INFO L93 Difference]: Finished difference Result 8611 states and 14694 transitions. [2025-03-08 05:34:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:28,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-03-08 05:34:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:28,764 INFO L225 Difference]: With dead ends: 8611 [2025-03-08 05:34:28,764 INFO L226 Difference]: Without dead ends: 5257 [2025-03-08 05:34:28,780 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-03-08 05:34:28,781 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 139 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1209 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-03-08 05:34:28,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2025-03-08 05:34:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 5225. [2025-03-08 05:34:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5225 states, 4198 states have (on average 1.6488804192472606) internal successors, (6922), 4210 states have internal predecessors, (6922), 918 states have call successors, (918), 98 states have call predecessors, (918), 108 states have return successors, (1130), 916 states have call predecessors, (1130), 914 states have call successors, (1130) [2025-03-08 05:34:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 8970 transitions. [2025-03-08 05:34:28,973 INFO L78 Accepts]: Start accepts. Automaton has 5225 states and 8970 transitions. Word has length 121 [2025-03-08 05:34:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 5225 states and 8970 transitions. [2025-03-08 05:34:28,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5225 states and 8970 transitions. [2025-03-08 05:34:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:34:28,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:28,994 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:28,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:34:28,994 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:28,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1730999309, now seen corresponding path program 1 times [2025-03-08 05:34:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:28,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848847258] [2025-03-08 05:34:28,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:29,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:34:29,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:34:29,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:29,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:29,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:29,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848847258] [2025-03-08 05:34:29,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848847258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:29,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436323234] [2025-03-08 05:34:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:29,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:29,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:29,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:29,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:29,043 INFO L87 Difference]: Start difference. First operand 5225 states and 8970 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:29,256 INFO L93 Difference]: Finished difference Result 12655 states and 21874 transitions. [2025-03-08 05:34:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:29,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-03-08 05:34:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:29,296 INFO L225 Difference]: With dead ends: 12655 [2025-03-08 05:34:29,296 INFO L226 Difference]: Without dead ends: 7885 [2025-03-08 05:34:29,316 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-03-08 05:34:29,316 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 137 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1204 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-03-08 05:34:29,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7885 states. [2025-03-08 05:34:29,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7885 to 7853. [2025-03-08 05:34:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7853 states, 6350 states have (on average 1.6582677165354331) internal successors, (10530), 6362 states have internal predecessors, (10530), 1394 states have call successors, (1394), 98 states have call predecessors, (1394), 108 states have return successors, (1670), 1392 states have call predecessors, (1670), 1390 states have call successors, (1670) [2025-03-08 05:34:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 13594 transitions. [2025-03-08 05:34:29,661 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 13594 transitions. Word has length 122 [2025-03-08 05:34:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:29,661 INFO L471 AbstractCegarLoop]: Abstraction has 7853 states and 13594 transitions. [2025-03-08 05:34:29,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 13594 transitions. [2025-03-08 05:34:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:34:29,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:29,694 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:29,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:34:29,694 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:29,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1811013591, now seen corresponding path program 1 times [2025-03-08 05:34:29,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:29,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303674431] [2025-03-08 05:34:29,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:29,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:29,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:34:29,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:34:29,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:29,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:29,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:29,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303674431] [2025-03-08 05:34:29,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303674431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:29,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:29,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:29,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722654946] [2025-03-08 05:34:29,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:29,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:29,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:29,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:29,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:29,736 INFO L87 Difference]: Start difference. First operand 7853 states and 13594 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:29,971 INFO L93 Difference]: Finished difference Result 18811 states and 32838 transitions. [2025-03-08 05:34:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:29,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-03-08 05:34:29,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:30,020 INFO L225 Difference]: With dead ends: 18811 [2025-03-08 05:34:30,020 INFO L226 Difference]: Without dead ends: 11925 [2025-03-08 05:34:30,115 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-03-08 05:34:30,116 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 135 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1199 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-03-08 05:34:30,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1199 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11925 states. [2025-03-08 05:34:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11925 to 11893. [2025-03-08 05:34:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11893 states, 9742 states have (on average 1.6659823444877848) internal successors, (16230), 9754 states have internal predecessors, (16230), 2042 states have call successors, (2042), 98 states have call predecessors, (2042), 108 states have return successors, (2486), 2040 states have call predecessors, (2486), 2038 states have call successors, (2486) [2025-03-08 05:34:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11893 states to 11893 states and 20758 transitions. [2025-03-08 05:34:30,575 INFO L78 Accepts]: Start accepts. Automaton has 11893 states and 20758 transitions. Word has length 123 [2025-03-08 05:34:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:30,575 INFO L471 AbstractCegarLoop]: Abstraction has 11893 states and 20758 transitions. [2025-03-08 05:34:30,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11893 states and 20758 transitions. [2025-03-08 05:34:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:34:30,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:30,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:30,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:34:30,618 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:30,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1061376684, now seen corresponding path program 1 times [2025-03-08 05:34:30,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:30,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358227977] [2025-03-08 05:34:30,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:30,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:30,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:34:30,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:34:30,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:30,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358227977] [2025-03-08 05:34:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358227977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:30,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:30,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:30,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043215369] [2025-03-08 05:34:30,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:30,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:30,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:30,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:30,681 INFO L87 Difference]: Start difference. First operand 11893 states and 20758 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:31,196 INFO L93 Difference]: Finished difference Result 28559 states and 50242 transitions. [2025-03-08 05:34:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-03-08 05:34:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:31,287 INFO L225 Difference]: With dead ends: 28559 [2025-03-08 05:34:31,287 INFO L226 Difference]: Without dead ends: 18465 [2025-03-08 05:34:31,328 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-03-08 05:34:31,330 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 133 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1199 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-03-08 05:34:31,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1199 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:31,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18465 states. [2025-03-08 05:34:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18465 to 18433. [2025-03-08 05:34:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18433 states, 15302 states have (on average 1.6715462031107045) internal successors, (25578), 15314 states have internal predecessors, (25578), 3022 states have call successors, (3022), 98 states have call predecessors, (3022), 108 states have return successors, (3746), 3020 states have call predecessors, (3746), 3018 states have call successors, (3746) [2025-03-08 05:34:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18433 states to 18433 states and 32346 transitions. [2025-03-08 05:34:32,074 INFO L78 Accepts]: Start accepts. Automaton has 18433 states and 32346 transitions. Word has length 124 [2025-03-08 05:34:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:32,075 INFO L471 AbstractCegarLoop]: Abstraction has 18433 states and 32346 transitions. [2025-03-08 05:34:32,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18433 states and 32346 transitions. [2025-03-08 05:34:32,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:34:32,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:32,118 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:32,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:34:32,118 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:32,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash 923612874, now seen corresponding path program 1 times [2025-03-08 05:34:32,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:32,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033390040] [2025-03-08 05:34:32,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:32,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:34:32,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:34:32,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:32,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:32,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:32,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033390040] [2025-03-08 05:34:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033390040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:32,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203357657] [2025-03-08 05:34:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:32,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:32,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:32,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:32,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:32,165 INFO L87 Difference]: Start difference. First operand 18433 states and 32346 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:32,676 INFO L93 Difference]: Finished difference Result 44831 states and 79306 transitions. [2025-03-08 05:34:32,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:32,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-03-08 05:34:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:32,815 INFO L225 Difference]: With dead ends: 44831 [2025-03-08 05:34:32,815 INFO L226 Difference]: Without dead ends: 29461 [2025-03-08 05:34:32,864 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-03-08 05:34:32,865 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 131 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1206 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-03-08 05:34:32,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29461 states. [2025-03-08 05:34:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29461 to 29429. [2025-03-08 05:34:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29429 states, 24326 states have (on average 1.670558250431637) internal successors, (40638), 24338 states have internal predecessors, (40638), 4994 states have call successors, (4994), 98 states have call predecessors, (4994), 108 states have return successors, (6206), 4992 states have call predecessors, (6206), 4990 states have call successors, (6206) [2025-03-08 05:34:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29429 states to 29429 states and 51838 transitions. [2025-03-08 05:34:33,986 INFO L78 Accepts]: Start accepts. Automaton has 29429 states and 51838 transitions. Word has length 125 [2025-03-08 05:34:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:33,986 INFO L471 AbstractCegarLoop]: Abstraction has 29429 states and 51838 transitions. [2025-03-08 05:34:33,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 29429 states and 51838 transitions. [2025-03-08 05:34:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:34:34,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:34,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:34,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:34:34,050 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:34,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1248500555, now seen corresponding path program 1 times [2025-03-08 05:34:34,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:34,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960705437] [2025-03-08 05:34:34,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:34,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:34,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:34:34,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:34:34,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:34,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:34,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:34,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960705437] [2025-03-08 05:34:34,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960705437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:34,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:34,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:34,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760690700] [2025-03-08 05:34:34,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:34,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:34,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:34,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:34,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:34,109 INFO L87 Difference]: Start difference. First operand 29429 states and 51838 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:35,277 INFO L93 Difference]: Finished difference Result 74339 states and 131526 transitions. [2025-03-08 05:34:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:35,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-03-08 05:34:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:35,485 INFO L225 Difference]: With dead ends: 74339 [2025-03-08 05:34:35,485 INFO L226 Difference]: Without dead ends: 49493 [2025-03-08 05:34:35,555 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-03-08 05:34:35,555 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 129 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1202 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-03-08 05:34:35,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1202 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49493 states. [2025-03-08 05:34:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49493 to 49461. [2025-03-08 05:34:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49461 states, 41070 states have (on average 1.6709520331141954) internal successors, (68626), 41082 states have internal predecessors, (68626), 8282 states have call successors, (8282), 98 states have call predecessors, (8282), 108 states have return successors, (10094), 8280 states have call predecessors, (10094), 8278 states have call successors, (10094) [2025-03-08 05:34:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49461 states to 49461 states and 87002 transitions. [2025-03-08 05:34:37,166 INFO L78 Accepts]: Start accepts. Automaton has 49461 states and 87002 transitions. Word has length 126 [2025-03-08 05:34:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 49461 states and 87002 transitions. [2025-03-08 05:34:37,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 49461 states and 87002 transitions. [2025-03-08 05:34:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:34:37,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:37,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:37,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:34:37,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 335955787, now seen corresponding path program 1 times [2025-03-08 05:34:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7978139] [2025-03-08 05:34:37,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:37,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:34:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:34:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:37,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:37,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7978139] [2025-03-08 05:34:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7978139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:37,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140307327] [2025-03-08 05:34:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:37,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:37,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:37,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:37,312 INFO L87 Difference]: Start difference. First operand 49461 states and 87002 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:39,262 INFO L93 Difference]: Finished difference Result 118511 states and 208566 transitions. [2025-03-08 05:34:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:39,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-08 05:34:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:39,624 INFO L225 Difference]: With dead ends: 118511 [2025-03-08 05:34:39,624 INFO L226 Difference]: Without dead ends: 77533 [2025-03-08 05:34:39,762 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-03-08 05:34:39,762 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 127 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1174 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-03-08 05:34:39,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77533 states. [2025-03-08 05:34:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77533 to 77501. [2025-03-08 05:34:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77501 states, 64298 states have (on average 1.6485427229462815) internal successors, (105998), 64310 states have internal predecessors, (105998), 13094 states have call successors, (13094), 98 states have call predecessors, (13094), 108 states have return successors, (16318), 13092 states have call predecessors, (16318), 13090 states have call successors, (16318) [2025-03-08 05:34:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77501 states to 77501 states and 135410 transitions. [2025-03-08 05:34:42,817 INFO L78 Accepts]: Start accepts. Automaton has 77501 states and 135410 transitions. Word has length 127 [2025-03-08 05:34:42,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:42,818 INFO L471 AbstractCegarLoop]: Abstraction has 77501 states and 135410 transitions. [2025-03-08 05:34:42,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:42,818 INFO L276 IsEmpty]: Start isEmpty. Operand 77501 states and 135410 transitions. [2025-03-08 05:34:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:34:43,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:43,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:43,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:34:43,220 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:43,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2139183210, now seen corresponding path program 1 times [2025-03-08 05:34:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962919953] [2025-03-08 05:34:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:43,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:34:43,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:34:43,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:43,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:43,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:43,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962919953] [2025-03-08 05:34:43,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962919953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:43,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:43,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:43,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362788509] [2025-03-08 05:34:43,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:43,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:43,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:43,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:43,272 INFO L87 Difference]: Start difference. First operand 77501 states and 135410 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:46,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:46,420 INFO L93 Difference]: Finished difference Result 204939 states and 359622 transitions. [2025-03-08 05:34:46,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:46,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-03-08 05:34:46,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:46,971 INFO L225 Difference]: With dead ends: 204939 [2025-03-08 05:34:46,972 INFO L226 Difference]: Without dead ends: 138481 [2025-03-08 05:34:47,137 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-03-08 05:34:47,138 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 125 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1202 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-03-08 05:34:47,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1202 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138481 states. [2025-03-08 05:34:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138481 to 138449. [2025-03-08 05:34:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138449 states, 115446 states have (on average 1.6455312440448349) internal successors, (189970), 115458 states have internal predecessors, (189970), 22894 states have call successors, (22894), 98 states have call predecessors, (22894), 108 states have return successors, (28826), 22892 states have call predecessors, (28826), 22890 states have call successors, (28826) [2025-03-08 05:34:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138449 states to 138449 states and 241690 transitions. [2025-03-08 05:34:52,789 INFO L78 Accepts]: Start accepts. Automaton has 138449 states and 241690 transitions. Word has length 128 [2025-03-08 05:34:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:52,790 INFO L471 AbstractCegarLoop]: Abstraction has 138449 states and 241690 transitions. [2025-03-08 05:34:52,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:34:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 138449 states and 241690 transitions. [2025-03-08 05:34:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:34:52,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:52,927 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:34:52,927 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1727427412, now seen corresponding path program 1 times [2025-03-08 05:34:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633149185] [2025-03-08 05:34:52,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:52,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:34:52,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:34:52,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:52,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:52,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:52,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633149185] [2025-03-08 05:34:52,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633149185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:52,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:52,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:52,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517326384] [2025-03-08 05:34:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:52,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:52,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:52,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:52,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:52,978 INFO L87 Difference]: Start difference. First operand 138449 states and 241690 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)