./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product23.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_product23.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa34593061e3e0a5eeea5cc3a3930a050ef50f60dff03c88799c643f69d7f641 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:54:05,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:54:05,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:54:05,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:54:05,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:54:05,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:54:05,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:54:05,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:54:05,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:54:05,381 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:54:05,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:54:05,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:54:05,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:54:05,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:54:05,383 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:54:05,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:54:05,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:54:05,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:54:05,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:54:05,385 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:54:05,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:05,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:05,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:05,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:05,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:54:05,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:05,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:05,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:05,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:05,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:54:05,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:54:05,386 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:54:05,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:54:05,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:54:05,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:54:05,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:54:05,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:54:05,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:54:05,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:54:05,387 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa34593061e3e0a5eeea5cc3a3930a050ef50f60dff03c88799c643f69d7f641 [2025-01-09 03:54:05,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:54:05,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:54:05,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:54:05,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:54:05,701 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:54:05,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product23.cil.c [2025-01-09 03:54:07,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83eef9c9c/a17b0efeda794c60b256b3a15b166e44/FLAG6fb5ec91d [2025-01-09 03:54:07,443 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:54:07,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product23.cil.c [2025-01-09 03:54:07,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83eef9c9c/a17b0efeda794c60b256b3a15b166e44/FLAG6fb5ec91d [2025-01-09 03:54:07,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83eef9c9c/a17b0efeda794c60b256b3a15b166e44 [2025-01-09 03:54:07,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:54:07,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:54:07,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:54:07,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:54:07,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:54:07,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:07" (1/1) ... [2025-01-09 03:54:07,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f53cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:07, skipping insertion in model container [2025-01-09 03:54:07,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:07" (1/1) ... [2025-01-09 03:54:07,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:54:08,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product23.cil.c[63051,63064] [2025-01-09 03:54:08,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:54:08,137 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:54:08,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-01-09 03:54:08,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2025-01-09 03:54:08,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [1494] [2025-01-09 03:54:08,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1535] [2025-01-09 03:54:08,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1553] [2025-01-09 03:54:08,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1659] [2025-01-09 03:54:08,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1999] [2025-01-09 03:54:08,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2228] [2025-01-09 03:54:08,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2629] [2025-01-09 03:54:08,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2920] [2025-01-09 03:54:08,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2929] [2025-01-09 03:54:08,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product23.cil.c[63051,63064] [2025-01-09 03:54:08,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:54:08,320 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:54:08,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08 WrapperNode [2025-01-09 03:54:08,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:54:08,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:08,324 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:54:08,324 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:54:08,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,432 INFO L138 Inliner]: procedures = 130, calls = 200, calls flagged for inlining = 59, calls inlined = 52, statements flattened = 966 [2025-01-09 03:54:08,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:08,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:54:08,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:54:08,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:54:08,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,506 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:54:08,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:54:08,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:54:08,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:54:08,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:54:08,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (1/1) ... [2025-01-09 03:54:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:08,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:08,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:54:08,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:54:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:54:08,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:54:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:54:08,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:54:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:54:08,664 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:54:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:54:08,664 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:54:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:54:08,665 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:54:08,665 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:54:08,665 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:54:08,665 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:54:08,665 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:54:08,665 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:54:08,666 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:54:08,666 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:54:08,666 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:54:08,666 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:54:08,666 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:54:08,666 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:54:08,666 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:54:08,666 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:54:08,666 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:54:08,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:54:08,666 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:54:08,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:54:08,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:54:08,877 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:54:08,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:54:09,905 INFO L? ?]: Removed 501 outVars from TransFormulas that were not future-live. [2025-01-09 03:54:09,905 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:54:09,930 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:54:09,931 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:54:09,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:09 BoogieIcfgContainer [2025-01-09 03:54:09,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:54:09,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:54:09,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:54:09,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:54:09,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:54:07" (1/3) ... [2025-01-09 03:54:09,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648fdcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:09, skipping insertion in model container [2025-01-09 03:54:09,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:08" (2/3) ... [2025-01-09 03:54:09,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@648fdcde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:09, skipping insertion in model container [2025-01-09 03:54:09,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:09" (3/3) ... [2025-01-09 03:54:09,941 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product23.cil.c [2025-01-09 03:54:09,954 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:54:09,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product23.cil.c that has 23 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:54:10,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:54:10,038 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;@6ae42934, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:54:10,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:54:10,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 292 states have (on average 1.5753424657534247) internal successors, (460), 295 states have internal predecessors, (460), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 03:54:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:54:10,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:10,069 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-01-09 03:54:10,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:10,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash 331483432, now seen corresponding path program 1 times [2025-01-09 03:54:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:10,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089507433] [2025-01-09 03:54:10,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:10,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:54:10,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:54:10,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:10,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:10,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089507433] [2025-01-09 03:54:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089507433] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226440619] [2025-01-09 03:54:10,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:10,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:10,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:10,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:10,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:54:11,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:54:11,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:54:11,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:11,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:11,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:54:11,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:11,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226440619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:11,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:11,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:11,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976482811] [2025-01-09 03:54:11,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:11,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:11,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:11,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:11,334 INFO L87 Difference]: Start difference. First operand has 368 states, 292 states have (on average 1.5753424657534247) internal successors, (460), 295 states have internal predecessors, (460), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) 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-01-09 03:54:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:11,425 INFO L93 Difference]: Finished difference Result 546 states and 824 transitions. [2025-01-09 03:54:11,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:11,427 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-01-09 03:54:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:11,438 INFO L225 Difference]: With dead ends: 546 [2025-01-09 03:54:11,438 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 03:54:11,443 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-01-09 03:54:11,445 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:11,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 03:54:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 362. [2025-01-09 03:54:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 287 states have (on average 1.5714285714285714) internal successors, (451), 289 states have internal predecessors, (451), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 03:54:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 554 transitions. [2025-01-09 03:54:11,523 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 554 transitions. Word has length 101 [2025-01-09 03:54:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:11,525 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 554 transitions. [2025-01-09 03:54:11,525 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-01-09 03:54:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 554 transitions. [2025-01-09 03:54:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:54:11,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:11,536 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-01-09 03:54:11,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:54:11,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:54:11,737 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:11,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1228028213, now seen corresponding path program 1 times [2025-01-09 03:54:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860550674] [2025-01-09 03:54:11,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:11,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:54:11,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:54:11,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:11,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:12,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:12,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860550674] [2025-01-09 03:54:12,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860550674] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:12,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813578556] [2025-01-09 03:54:12,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:12,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:12,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:12,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:12,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:54:12,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:54:12,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:54:12,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:12,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:12,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813578556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:12,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:12,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:12,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532128070] [2025-01-09 03:54:12,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:12,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:12,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:12,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:12,457 INFO L87 Difference]: Start difference. First operand 362 states and 554 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-01-09 03:54:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:12,511 INFO L93 Difference]: Finished difference Result 772 states and 1200 transitions. [2025-01-09 03:54:12,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:12,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 109 [2025-01-09 03:54:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:12,520 INFO L225 Difference]: With dead ends: 772 [2025-01-09 03:54:12,521 INFO L226 Difference]: Without dead ends: 436 [2025-01-09 03:54:12,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:12,524 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 134 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:12,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1069 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-09 03:54:12,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 428. [2025-01-09 03:54:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 339 states have (on average 1.5899705014749264) internal successors, (539), 341 states have internal predecessors, (539), 66 states have call successors, (66), 22 states have call predecessors, (66), 22 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-01-09 03:54:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 670 transitions. [2025-01-09 03:54:12,584 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 670 transitions. Word has length 109 [2025-01-09 03:54:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:12,584 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 670 transitions. [2025-01-09 03:54:12,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-01-09 03:54:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 670 transitions. [2025-01-09 03:54:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:54:12,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:12,590 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, 1] [2025-01-09 03:54:12,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:54:12,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:12,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash 666832784, now seen corresponding path program 1 times [2025-01-09 03:54:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:12,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864989234] [2025-01-09 03:54:12,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:12,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:54:12,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:54:12,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:13,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864989234] [2025-01-09 03:54:13,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864989234] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:13,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405732611] [2025-01-09 03:54:13,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:13,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:13,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:13,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:13,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:54:13,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:54:13,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:54:13,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:13,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:13,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:54:13,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:13,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405732611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:13,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:13,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533824461] [2025-01-09 03:54:13,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:13,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:13,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:13,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:13,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:13,451 INFO L87 Difference]: Start difference. First operand 428 states and 670 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), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:13,537 INFO L93 Difference]: Finished difference Result 847 states and 1330 transitions. [2025-01-09 03:54:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:13,539 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), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-01-09 03:54:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:13,544 INFO L225 Difference]: With dead ends: 847 [2025-01-09 03:54:13,544 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 03:54:13,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:13,549 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 2 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:13,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2169 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 03:54:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-01-09 03:54:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 340 states have (on average 1.588235294117647) internal successors, (540), 343 states have internal predecessors, (540), 66 states have call successors, (66), 22 states have call predecessors, (66), 23 states have return successors, (67), 64 states have call predecessors, (67), 65 states have call successors, (67) [2025-01-09 03:54:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 673 transitions. [2025-01-09 03:54:13,583 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 673 transitions. Word has length 110 [2025-01-09 03:54:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:13,584 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 673 transitions. [2025-01-09 03:54:13,585 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), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 673 transitions. [2025-01-09 03:54:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:54:13,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:13,589 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, 1] [2025-01-09 03:54:13,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:13,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:13,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:13,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2143909575, now seen corresponding path program 1 times [2025-01-09 03:54:13,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:13,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068131071] [2025-01-09 03:54:13,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:13,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:54:13,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:54:13,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:13,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068131071] [2025-01-09 03:54:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068131071] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983667076] [2025-01-09 03:54:14,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:14,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:14,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:14,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:14,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:54:14,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:54:14,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:54:14,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:14,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:14,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:14,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983667076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:14,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:14,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:54:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879814594] [2025-01-09 03:54:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:14,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:14,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:14,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:14,406 INFO L87 Difference]: Start difference. First operand 430 states and 673 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-09 03:54:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:14,497 INFO L93 Difference]: Finished difference Result 849 states and 1335 transitions. [2025-01-09 03:54:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 111 [2025-01-09 03:54:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:14,504 INFO L225 Difference]: With dead ends: 849 [2025-01-09 03:54:14,504 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 03:54:14,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:14,506 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:14,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2155 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 03:54:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-01-09 03:54:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 345 states have internal predecessors, (541), 66 states have call successors, (66), 22 states have call predecessors, (66), 24 states have return successors, (72), 64 states have call predecessors, (72), 65 states have call successors, (72) [2025-01-09 03:54:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 679 transitions. [2025-01-09 03:54:14,537 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 679 transitions. Word has length 111 [2025-01-09 03:54:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:14,538 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 679 transitions. [2025-01-09 03:54:14,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-09 03:54:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 679 transitions. [2025-01-09 03:54:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:54:14,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:14,544 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] [2025-01-09 03:54:14,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:54:14,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:14,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:14,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1580145514, now seen corresponding path program 1 times [2025-01-09 03:54:14,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:14,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270355847] [2025-01-09 03:54:14,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:14,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:14,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:54:14,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:54:14,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:14,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270355847] [2025-01-09 03:54:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270355847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11962000] [2025-01-09 03:54:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:14,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:14,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:14,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:14,907 INFO L87 Difference]: Start difference. First operand 432 states and 679 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-01-09 03:54:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:14,966 INFO L93 Difference]: Finished difference Result 841 states and 1326 transitions. [2025-01-09 03:54:14,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:14,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 112 [2025-01-09 03:54:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:14,971 INFO L225 Difference]: With dead ends: 841 [2025-01-09 03:54:14,971 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 03:54:14,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:14,973 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 2 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:14,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2173 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 03:54:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-01-09 03:54:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 345 states have internal predecessors, (541), 66 states have call successors, (66), 22 states have call predecessors, (66), 24 states have return successors, (71), 64 states have call predecessors, (71), 65 states have call successors, (71) [2025-01-09 03:54:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 678 transitions. [2025-01-09 03:54:14,998 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 678 transitions. Word has length 112 [2025-01-09 03:54:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:14,998 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 678 transitions. [2025-01-09 03:54:14,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-01-09 03:54:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 678 transitions. [2025-01-09 03:54:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:54:15,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:15,003 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, 1] [2025-01-09 03:54:15,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:54:15,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:15,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash 368734965, now seen corresponding path program 2 times [2025-01-09 03:54:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261433473] [2025-01-09 03:54:15,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:15,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:15,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-01-09 03:54:15,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 113 statements. [2025-01-09 03:54:15,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:15,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261433473] [2025-01-09 03:54:15,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261433473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:15,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:15,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:15,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914797069] [2025-01-09 03:54:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:15,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:15,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:15,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:15,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:15,184 INFO L87 Difference]: Start difference. First operand 432 states and 678 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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-01-09 03:54:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:15,667 INFO L93 Difference]: Finished difference Result 857 states and 1354 transitions. [2025-01-09 03:54:15,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:54:15,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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 113 [2025-01-09 03:54:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:15,674 INFO L225 Difference]: With dead ends: 857 [2025-01-09 03:54:15,674 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 03:54:15,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:54:15,676 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 503 mSDsluCounter, 3096 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:15,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3648 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:54:15,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 03:54:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 845. [2025-01-09 03:54:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 671 states have (on average 1.5961251862891208) internal successors, (1071), 676 states have internal predecessors, (1071), 126 states have call successors, (126), 44 states have call predecessors, (126), 47 states have return successors, (139), 124 states have call predecessors, (139), 124 states have call successors, (139) [2025-01-09 03:54:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1336 transitions. [2025-01-09 03:54:15,735 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1336 transitions. Word has length 113 [2025-01-09 03:54:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:15,736 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1336 transitions. [2025-01-09 03:54:15,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 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-01-09 03:54:15,736 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1336 transitions. [2025-01-09 03:54:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:54:15,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:15,741 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] [2025-01-09 03:54:15,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:54:15,742 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1655150164, now seen corresponding path program 1 times [2025-01-09 03:54:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:15,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71025513] [2025-01-09 03:54:15,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:15,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:54:15,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:54:15,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:15,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:15,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:15,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71025513] [2025-01-09 03:54:15,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71025513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:15,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:15,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:15,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874192356] [2025-01-09 03:54:15,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:15,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:15,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:15,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:15,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:15,894 INFO L87 Difference]: Start difference. First operand 845 states and 1336 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 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-01-09 03:54:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:15,965 INFO L93 Difference]: Finished difference Result 1669 states and 2645 transitions. [2025-01-09 03:54:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 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 114 [2025-01-09 03:54:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:15,972 INFO L225 Difference]: With dead ends: 1669 [2025-01-09 03:54:15,973 INFO L226 Difference]: Without dead ends: 847 [2025-01-09 03:54:15,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:15,977 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 1 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:15,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-01-09 03:54:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-01-09 03:54:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 672 states have (on average 1.5952380952380953) internal successors, (1072), 678 states have internal predecessors, (1072), 126 states have call successors, (126), 44 states have call predecessors, (126), 48 states have return successors, (141), 124 states have call predecessors, (141), 124 states have call successors, (141) [2025-01-09 03:54:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1339 transitions. [2025-01-09 03:54:16,032 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1339 transitions. Word has length 114 [2025-01-09 03:54:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:16,032 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1339 transitions. [2025-01-09 03:54:16,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 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-01-09 03:54:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1339 transitions. [2025-01-09 03:54:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:54:16,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:16,038 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] [2025-01-09 03:54:16,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:54:16,038 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:16,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1283951172, now seen corresponding path program 1 times [2025-01-09 03:54:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:16,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529896822] [2025-01-09 03:54:16,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:16,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:54:16,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:54:16,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:16,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529896822] [2025-01-09 03:54:16,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529896822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:16,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029074937] [2025-01-09 03:54:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:16,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:16,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:16,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:16,226 INFO L87 Difference]: Start difference. First operand 847 states and 1339 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 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-01-09 03:54:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:16,371 INFO L93 Difference]: Finished difference Result 1255 states and 1983 transitions. [2025-01-09 03:54:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:16,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 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 115 [2025-01-09 03:54:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:16,376 INFO L225 Difference]: With dead ends: 1255 [2025-01-09 03:54:16,376 INFO L226 Difference]: Without dead ends: 436 [2025-01-09 03:54:16,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:54:16,379 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 7 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3730 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:16,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3730 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-09 03:54:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-01-09 03:54:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 344 states have (on average 1.5813953488372092) internal successors, (544), 348 states have internal predecessors, (544), 66 states have call successors, (66), 23 states have call predecessors, (66), 25 states have return successors, (72), 64 states have call predecessors, (72), 65 states have call successors, (72) [2025-01-09 03:54:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 682 transitions. [2025-01-09 03:54:16,399 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 682 transitions. Word has length 115 [2025-01-09 03:54:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:16,399 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 682 transitions. [2025-01-09 03:54:16,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 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-01-09 03:54:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 682 transitions. [2025-01-09 03:54:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:54:16,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:16,402 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, 1, 1, 1] [2025-01-09 03:54:16,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:54:16,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:16,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1456722264, now seen corresponding path program 1 times [2025-01-09 03:54:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:16,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444326215] [2025-01-09 03:54:16,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:16,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:16,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:54:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:54:16,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:16,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444326215] [2025-01-09 03:54:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444326215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:16,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:16,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:16,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936906139] [2025-01-09 03:54:16,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:16,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:16,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:16,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:16,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:16,556 INFO L87 Difference]: Start difference. First operand 436 states and 682 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-01-09 03:54:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:16,708 INFO L93 Difference]: Finished difference Result 848 states and 1335 transitions. [2025-01-09 03:54:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:16,709 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 115 [2025-01-09 03:54:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:16,713 INFO L225 Difference]: With dead ends: 848 [2025-01-09 03:54:16,713 INFO L226 Difference]: Without dead ends: 439 [2025-01-09 03:54:16,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:54:16,715 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 5 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:16,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3744 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-01-09 03:54:16,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-01-09 03:54:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 346 states have (on average 1.5780346820809248) internal successors, (546), 351 states have internal predecessors, (546), 66 states have call successors, (66), 23 states have call predecessors, (66), 26 states have return successors, (77), 64 states have call predecessors, (77), 65 states have call successors, (77) [2025-01-09 03:54:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 689 transitions. [2025-01-09 03:54:16,736 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 689 transitions. Word has length 115 [2025-01-09 03:54:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:16,737 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 689 transitions. [2025-01-09 03:54:16,737 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-01-09 03:54:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 689 transitions. [2025-01-09 03:54:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:54:16,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:16,740 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-01-09 03:54:16,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:54:16,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:16,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:16,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1501840480, now seen corresponding path program 1 times [2025-01-09 03:54:16,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:16,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109702402] [2025-01-09 03:54:16,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:16,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:54:16,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:54:16,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:16,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:16,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109702402] [2025-01-09 03:54:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109702402] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789191698] [2025-01-09 03:54:16,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:16,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:16,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:16,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:16,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:54:17,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:54:17,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:54:17,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:17,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:17,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:17,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:17,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:54:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789191698] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:54:17,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:54:17,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:54:17,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901649374] [2025-01-09 03:54:17,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:54:17,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:54:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:17,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:54:17,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:17,374 INFO L87 Difference]: Start difference. First operand 439 states and 689 transitions. Second operand has 11 states, 10 states have (on average 11.7) internal successors, (117), 11 states have internal predecessors, (117), 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-01-09 03:54:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:18,145 INFO L93 Difference]: Finished difference Result 1285 states and 2105 transitions. [2025-01-09 03:54:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:54:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.7) internal successors, (117), 11 states have internal predecessors, (117), 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 116 [2025-01-09 03:54:18,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:18,152 INFO L225 Difference]: With dead ends: 1285 [2025-01-09 03:54:18,154 INFO L226 Difference]: Without dead ends: 877 [2025-01-09 03:54:18,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:54:18,157 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 1338 mSDsluCounter, 4141 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 4684 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:18,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 4684 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:54:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-01-09 03:54:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 853. [2025-01-09 03:54:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 681 states have (on average 1.6270190895741556) internal successors, (1108), 685 states have internal predecessors, (1108), 145 states have call successors, (145), 24 states have call predecessors, (145), 26 states have return successors, (166), 143 states have call predecessors, (166), 144 states have call successors, (166) [2025-01-09 03:54:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1419 transitions. [2025-01-09 03:54:18,210 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1419 transitions. Word has length 116 [2025-01-09 03:54:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:18,210 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1419 transitions. [2025-01-09 03:54:18,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.7) internal successors, (117), 11 states have internal predecessors, (117), 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-01-09 03:54:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1419 transitions. [2025-01-09 03:54:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:54:18,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:18,218 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:18,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:54:18,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:54:18,424 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:18,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1622159431, now seen corresponding path program 1 times [2025-01-09 03:54:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595163170] [2025-01-09 03:54:18,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:18,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:54:18,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:54:18,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:18,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595163170] [2025-01-09 03:54:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595163170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:18,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196668790] [2025-01-09 03:54:18,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:18,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:18,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:18,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:18,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:18,511 INFO L87 Difference]: Start difference. First operand 853 states and 1419 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-01-09 03:54:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:18,574 INFO L93 Difference]: Finished difference Result 2016 states and 3411 transitions. [2025-01-09 03:54:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 120 [2025-01-09 03:54:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:18,584 INFO L225 Difference]: With dead ends: 2016 [2025-01-09 03:54:18,584 INFO L226 Difference]: Without dead ends: 1244 [2025-01-09 03:54:18,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:18,588 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 131 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:18,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2025-01-09 03:54:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1236. [2025-01-09 03:54:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 985 states have (on average 1.6456852791878172) internal successors, (1621), 989 states have internal predecessors, (1621), 224 states have call successors, (224), 24 states have call predecessors, (224), 26 states have return successors, (255), 222 states have call predecessors, (255), 223 states have call successors, (255) [2025-01-09 03:54:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 2100 transitions. [2025-01-09 03:54:18,681 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 2100 transitions. Word has length 120 [2025-01-09 03:54:18,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:18,682 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 2100 transitions. [2025-01-09 03:54:18,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-01-09 03:54:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 2100 transitions. [2025-01-09 03:54:18,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:54:18,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:18,691 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:54:18,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:18,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash -296910495, now seen corresponding path program 1 times [2025-01-09 03:54:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879822280] [2025-01-09 03:54:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:18,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:54:18,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:54:18,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:18,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879822280] [2025-01-09 03:54:18,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879822280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:18,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:18,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152388485] [2025-01-09 03:54:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:18,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:18,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:18,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:18,764 INFO L87 Difference]: Start difference. First operand 1236 states and 2100 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-09 03:54:18,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:18,867 INFO L93 Difference]: Finished difference Result 2973 states and 5087 transitions. [2025-01-09 03:54:18,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:18,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-09 03:54:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:18,887 INFO L225 Difference]: With dead ends: 2973 [2025-01-09 03:54:18,887 INFO L226 Difference]: Without dead ends: 1869 [2025-01-09 03:54:18,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:18,895 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 129 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:18,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1096 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-01-09 03:54:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1861. [2025-01-09 03:54:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1491 states have (on average 1.6545942320590208) internal successors, (2467), 1495 states have internal predecessors, (2467), 343 states have call successors, (343), 24 states have call predecessors, (343), 26 states have return successors, (374), 341 states have call predecessors, (374), 342 states have call successors, (374) [2025-01-09 03:54:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 3184 transitions. [2025-01-09 03:54:19,024 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 3184 transitions. Word has length 121 [2025-01-09 03:54:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:19,025 INFO L471 AbstractCegarLoop]: Abstraction has 1861 states and 3184 transitions. [2025-01-09 03:54:19,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-01-09 03:54:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 3184 transitions. [2025-01-09 03:54:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:54:19,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:19,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:19,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:54:19,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:19,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1590257927, now seen corresponding path program 1 times [2025-01-09 03:54:19,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:19,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074523804] [2025-01-09 03:54:19,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:19,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:19,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:54:19,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:54:19,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:19,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:19,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:19,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074523804] [2025-01-09 03:54:19,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074523804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:19,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:19,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:19,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820406706] [2025-01-09 03:54:19,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:19,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:19,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:19,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:19,107 INFO L87 Difference]: Start difference. First operand 1861 states and 3184 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-01-09 03:54:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:19,214 INFO L93 Difference]: Finished difference Result 4425 states and 7636 transitions. [2025-01-09 03:54:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:19,215 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 122 [2025-01-09 03:54:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:19,238 INFO L225 Difference]: With dead ends: 4425 [2025-01-09 03:54:19,238 INFO L226 Difference]: Without dead ends: 2827 [2025-01-09 03:54:19,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:19,247 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 127 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:19,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1093 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2025-01-09 03:54:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2819. [2025-01-09 03:54:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2287 states have (on average 1.6620026235242675) internal successors, (3801), 2291 states have internal predecessors, (3801), 505 states have call successors, (505), 24 states have call predecessors, (505), 26 states have return successors, (552), 503 states have call predecessors, (552), 504 states have call successors, (552) [2025-01-09 03:54:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 4858 transitions. [2025-01-09 03:54:19,460 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 4858 transitions. Word has length 122 [2025-01-09 03:54:19,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:19,462 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 4858 transitions. [2025-01-09 03:54:19,462 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-01-09 03:54:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 4858 transitions. [2025-01-09 03:54:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:54:19,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:19,478 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:19,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:54:19,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:19,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1831409730, now seen corresponding path program 1 times [2025-01-09 03:54:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:19,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618811895] [2025-01-09 03:54:19,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:19,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:19,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:54:19,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:54:19,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:19,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:19,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:19,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618811895] [2025-01-09 03:54:19,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618811895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:19,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:19,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:19,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794560808] [2025-01-09 03:54:19,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:19,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:19,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:19,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:19,554 INFO L87 Difference]: Start difference. First operand 2819 states and 4858 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-01-09 03:54:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:19,703 INFO L93 Difference]: Finished difference Result 6718 states and 11668 transitions. [2025-01-09 03:54:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:19,704 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 123 [2025-01-09 03:54:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:19,736 INFO L225 Difference]: With dead ends: 6718 [2025-01-09 03:54:19,737 INFO L226 Difference]: Without dead ends: 4374 [2025-01-09 03:54:19,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:19,751 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 125 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:19,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1093 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4374 states. [2025-01-09 03:54:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4374 to 4366. [2025-01-09 03:54:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4366 states, 3589 states have (on average 1.66731680133742) internal successors, (5984), 3593 states have internal predecessors, (5984), 750 states have call successors, (750), 24 states have call predecessors, (750), 26 states have return successors, (823), 748 states have call predecessors, (823), 749 states have call successors, (823) [2025-01-09 03:54:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4366 states to 4366 states and 7557 transitions. [2025-01-09 03:54:20,093 INFO L78 Accepts]: Start accepts. Automaton has 4366 states and 7557 transitions. Word has length 123 [2025-01-09 03:54:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:20,094 INFO L471 AbstractCegarLoop]: Abstraction has 4366 states and 7557 transitions. [2025-01-09 03:54:20,094 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-01-09 03:54:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 4366 states and 7557 transitions. [2025-01-09 03:54:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:54:20,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:20,114 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:20,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:54:20,115 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:20,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1636696445, now seen corresponding path program 1 times [2025-01-09 03:54:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492853112] [2025-01-09 03:54:20,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:20,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:20,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:54:20,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:54:20,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:20,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492853112] [2025-01-09 03:54:20,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492853112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:20,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:20,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:20,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142754040] [2025-01-09 03:54:20,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:20,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:20,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:20,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:20,188 INFO L87 Difference]: Start difference. First operand 4366 states and 7557 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-01-09 03:54:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:20,461 INFO L93 Difference]: Finished difference Result 10812 states and 18820 transitions. [2025-01-09 03:54:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:20,462 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 124 [2025-01-09 03:54:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:20,521 INFO L225 Difference]: With dead ends: 10812 [2025-01-09 03:54:20,525 INFO L226 Difference]: Without dead ends: 7162 [2025-01-09 03:54:20,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:20,547 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 123 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:20,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7162 states. [2025-01-09 03:54:21,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7162 to 7154. [2025-01-09 03:54:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7154 states, 5884 states have (on average 1.663494221617947) internal successors, (9788), 5888 states have internal predecessors, (9788), 1243 states have call successors, (1243), 24 states have call predecessors, (1243), 26 states have return successors, (1360), 1241 states have call predecessors, (1360), 1242 states have call successors, (1360) [2025-01-09 03:54:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7154 states to 7154 states and 12391 transitions. [2025-01-09 03:54:21,090 INFO L78 Accepts]: Start accepts. Automaton has 7154 states and 12391 transitions. Word has length 124 [2025-01-09 03:54:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:21,091 INFO L471 AbstractCegarLoop]: Abstraction has 7154 states and 12391 transitions. [2025-01-09 03:54:21,091 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-01-09 03:54:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7154 states and 12391 transitions. [2025-01-09 03:54:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:54:21,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:21,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:21,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:54:21,119 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:21,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1891040966, now seen corresponding path program 1 times [2025-01-09 03:54:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052110659] [2025-01-09 03:54:21,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:21,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:54:21,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:54:21,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:21,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:21,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:21,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052110659] [2025-01-09 03:54:21,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052110659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:21,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:21,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:21,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154165195] [2025-01-09 03:54:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:21,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:21,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:21,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:21,193 INFO L87 Difference]: Start difference. First operand 7154 states and 12391 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-01-09 03:54:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:21,664 INFO L93 Difference]: Finished difference Result 18099 states and 31540 transitions. [2025-01-09 03:54:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:21,664 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 125 [2025-01-09 03:54:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:21,760 INFO L225 Difference]: With dead ends: 18099 [2025-01-09 03:54:21,761 INFO L226 Difference]: Without dead ends: 12047 [2025-01-09 03:54:21,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:21,802 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 121 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:21,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1098 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12047 states. [2025-01-09 03:54:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12047 to 12039. [2025-01-09 03:54:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12039 states, 9947 states have (on average 1.6633155725344324) internal successors, (16545), 9951 states have internal predecessors, (16545), 2065 states have call successors, (2065), 24 states have call predecessors, (2065), 26 states have return successors, (2260), 2063 states have call predecessors, (2260), 2064 states have call successors, (2260) [2025-01-09 03:54:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12039 states to 12039 states and 20870 transitions. [2025-01-09 03:54:22,567 INFO L78 Accepts]: Start accepts. Automaton has 12039 states and 20870 transitions. Word has length 125 [2025-01-09 03:54:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:22,567 INFO L471 AbstractCegarLoop]: Abstraction has 12039 states and 20870 transitions. [2025-01-09 03:54:22,568 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-01-09 03:54:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 12039 states and 20870 transitions. [2025-01-09 03:54:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:54:22,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:22,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:22,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:54:22,602 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:22,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:22,603 INFO L85 PathProgramCache]: Analyzing trace with hash -968133435, now seen corresponding path program 1 times [2025-01-09 03:54:22,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:22,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616854476] [2025-01-09 03:54:22,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:22,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:22,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:54:22,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:54:22,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:22,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:22,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616854476] [2025-01-09 03:54:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616854476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:22,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:22,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559034711] [2025-01-09 03:54:22,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:22,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:22,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:22,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:22,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:22,685 INFO L87 Difference]: Start difference. First operand 12039 states and 20870 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-01-09 03:54:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:23,299 INFO L93 Difference]: Finished difference Result 28819 states and 49881 transitions. [2025-01-09 03:54:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:23,300 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 126 [2025-01-09 03:54:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:23,409 INFO L225 Difference]: With dead ends: 28819 [2025-01-09 03:54:23,409 INFO L226 Difference]: Without dead ends: 18834 [2025-01-09 03:54:23,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:23,457 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 119 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:23,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1068 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18834 states. [2025-01-09 03:54:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18834 to 18826. [2025-01-09 03:54:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18826 states, 15531 states have (on average 1.6385937801815724) internal successors, (25449), 15535 states have internal predecessors, (25449), 3268 states have call successors, (3268), 24 states have call predecessors, (3268), 26 states have return successors, (3607), 3266 states have call predecessors, (3607), 3267 states have call successors, (3607) [2025-01-09 03:54:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18826 states to 18826 states and 32324 transitions. [2025-01-09 03:54:24,536 INFO L78 Accepts]: Start accepts. Automaton has 18826 states and 32324 transitions. Word has length 126 [2025-01-09 03:54:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:24,537 INFO L471 AbstractCegarLoop]: Abstraction has 18826 states and 32324 transitions. [2025-01-09 03:54:24,537 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-01-09 03:54:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18826 states and 32324 transitions. [2025-01-09 03:54:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:54:24,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:24,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:24,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:54:24,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:24,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2026150215, now seen corresponding path program 1 times [2025-01-09 03:54:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:24,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356042382] [2025-01-09 03:54:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:24,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:54:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:54:24,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:24,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:24,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356042382] [2025-01-09 03:54:24,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356042382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:24,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:24,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:24,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445255254] [2025-01-09 03:54:24,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:24,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:24,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:24,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:24,657 INFO L87 Difference]: Start difference. First operand 18826 states and 32324 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-01-09 03:54:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:26,071 INFO L93 Difference]: Finished difference Result 49811 states and 85819 transitions. [2025-01-09 03:54:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:26,072 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 127 [2025-01-09 03:54:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:26,264 INFO L225 Difference]: With dead ends: 49811 [2025-01-09 03:54:26,264 INFO L226 Difference]: Without dead ends: 33652 [2025-01-09 03:54:26,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:26,332 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 117 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:26,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1096 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:26,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33652 states. [2025-01-09 03:54:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33652 to 33644. [2025-01-09 03:54:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33644 states, 27899 states have (on average 1.6348973081472453) internal successors, (45612), 27903 states have internal predecessors, (45612), 5718 states have call successors, (5718), 24 states have call predecessors, (5718), 26 states have return successors, (6331), 5716 states have call predecessors, (6331), 5717 states have call successors, (6331) [2025-01-09 03:54:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33644 states to 33644 states and 57661 transitions. [2025-01-09 03:54:28,051 INFO L78 Accepts]: Start accepts. Automaton has 33644 states and 57661 transitions. Word has length 127 [2025-01-09 03:54:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:28,052 INFO L471 AbstractCegarLoop]: Abstraction has 33644 states and 57661 transitions. [2025-01-09 03:54:28,052 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-01-09 03:54:28,052 INFO L276 IsEmpty]: Start isEmpty. Operand 33644 states and 57661 transitions. [2025-01-09 03:54:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:54:28,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:28,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:28,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:54:28,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:28,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:28,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1881073695, now seen corresponding path program 1 times [2025-01-09 03:54:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712062748] [2025-01-09 03:54:28,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:28,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:54:28,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:54:28,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:28,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:28,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712062748] [2025-01-09 03:54:28,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712062748] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:28,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656546735] [2025-01-09 03:54:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:28,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:28,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:28,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:28,161 INFO L87 Difference]: Start difference. First operand 33644 states and 57661 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-01-09 03:54:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:30,350 INFO L93 Difference]: Finished difference Result 91848 states and 157851 transitions. [2025-01-09 03:54:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:30,351 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 128 [2025-01-09 03:54:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:30,810 INFO L225 Difference]: With dead ends: 91848 [2025-01-09 03:54:30,811 INFO L226 Difference]: Without dead ends: 61750 [2025-01-09 03:54:30,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:30,969 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 115 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:30,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1100 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61750 states. [2025-01-09 03:54:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61750 to 61742. [2025-01-09 03:54:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61742 states, 51484 states have (on average 1.6301763654727683) internal successors, (83928), 51488 states have internal predecessors, (83928), 10231 states have call successors, (10231), 24 states have call predecessors, (10231), 26 states have return successors, (11376), 10229 states have call predecessors, (11376), 10230 states have call successors, (11376) [2025-01-09 03:54:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61742 states to 61742 states and 105535 transitions. [2025-01-09 03:54:34,177 INFO L78 Accepts]: Start accepts. Automaton has 61742 states and 105535 transitions. Word has length 128 [2025-01-09 03:54:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:34,178 INFO L471 AbstractCegarLoop]: Abstraction has 61742 states and 105535 transitions. [2025-01-09 03:54:34,179 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-01-09 03:54:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 61742 states and 105535 transitions. [2025-01-09 03:54:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:54:34,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:34,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:34,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:54:34,215 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:34,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:34,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1533025625, now seen corresponding path program 1 times [2025-01-09 03:54:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:34,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28465942] [2025-01-09 03:54:34,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:34,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:54:34,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:54:34,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:34,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:34,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:34,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28465942] [2025-01-09 03:54:34,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28465942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:34,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:34,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147040550] [2025-01-09 03:54:34,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:34,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:34,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:34,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:34,534 INFO L87 Difference]: Start difference. First operand 61742 states and 105535 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-01-09 03:54:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:36,925 INFO L93 Difference]: Finished difference Result 115705 states and 198140 transitions. [2025-01-09 03:54:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:36,926 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 129 [2025-01-09 03:54:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:37,864 INFO L225 Difference]: With dead ends: 115705 [2025-01-09 03:54:37,865 INFO L226 Difference]: Without dead ends: 115535 [2025-01-09 03:54:37,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:37,922 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 110 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:37,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1102 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115535 states. [2025-01-09 03:54:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115535 to 115527. [2025-01-09 03:54:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115527 states, 96901 states have (on average 1.6244208006109329) internal successors, (157408), 96905 states have internal predecessors, (157408), 18599 states have call successors, (18599), 24 states have call predecessors, (18599), 26 states have return successors, (20790), 18597 states have call predecessors, (20790), 18598 states have call successors, (20790) [2025-01-09 03:54:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115527 states to 115527 states and 196797 transitions. [2025-01-09 03:54:42,305 INFO L78 Accepts]: Start accepts. Automaton has 115527 states and 196797 transitions. Word has length 129 [2025-01-09 03:54:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:42,305 INFO L471 AbstractCegarLoop]: Abstraction has 115527 states and 196797 transitions. [2025-01-09 03:54:42,306 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-01-09 03:54:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 115527 states and 196797 transitions. [2025-01-09 03:54:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:54:42,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:42,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:54:42,352 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:42,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash 278481438, now seen corresponding path program 1 times [2025-01-09 03:54:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:42,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747312715] [2025-01-09 03:54:42,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:42,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:42,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:54:42,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:54:42,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:42,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747312715] [2025-01-09 03:54:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747312715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:54:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610735188] [2025-01-09 03:54:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:54:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:42,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:54:42,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:42,851 INFO L87 Difference]: Start difference. First operand 115527 states and 196797 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:45,454 INFO L93 Difference]: Finished difference Result 115857 states and 197273 transitions. [2025-01-09 03:54:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:54:45,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-01-09 03:54:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:46,071 INFO L225 Difference]: With dead ends: 115857 [2025-01-09 03:54:46,071 INFO L226 Difference]: Without dead ends: 115695 [2025-01-09 03:54:46,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:54:46,143 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 489 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 2850 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:46,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 2850 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:54:46,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115695 states. [2025-01-09 03:54:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115695 to 115691. [2025-01-09 03:54:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115691 states, 97030 states have (on average 1.6242296197052457) internal successors, (157599), 97035 states have internal predecessors, (157599), 18620 states have call successors, (18620), 36 states have call predecessors, (18620), 40 states have return successors, (20814), 18619 states have call predecessors, (20814), 18618 states have call successors, (20814) [2025-01-09 03:54:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115691 states to 115691 states and 197033 transitions. [2025-01-09 03:54:50,239 INFO L78 Accepts]: Start accepts. Automaton has 115691 states and 197033 transitions. Word has length 130 [2025-01-09 03:54:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:50,239 INFO L471 AbstractCegarLoop]: Abstraction has 115691 states and 197033 transitions. [2025-01-09 03:54:50,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 115691 states and 197033 transitions. [2025-01-09 03:54:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:54:50,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:50,279 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:50,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:54:50,280 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:50,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash 915747758, now seen corresponding path program 1 times [2025-01-09 03:54:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:50,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178945609] [2025-01-09 03:54:50,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:50,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:54:50,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:54:50,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:50,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178945609] [2025-01-09 03:54:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178945609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:54:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612662696] [2025-01-09 03:54:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:54:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:50,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:54:50,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:54:50,604 INFO L87 Difference]: Start difference. First operand 115691 states and 197033 transitions. Second operand has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 8 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13)