./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product35.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8693f57a03775f9dd58f5523ab36f07a2ce550b119e4923229e8bee683b68937 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:27:01,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:27:01,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:27:01,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:27:01,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:27:01,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:27:01,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:27:01,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:27:01,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:27:01,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:27:01,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:27:01,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:27:01,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:27:01,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:27:01,656 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:27:01,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:27:01,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:27:01,656 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:27:01,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:27:01,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:27:01,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:27:01,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:27:01,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:27:01,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:27:01,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:27:01,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:27:01,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:27:01,658 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:27:01,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:27:01,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:27:01,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:27:01,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:27:01,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:27:01,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:27:01,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:27:01,659 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8693f57a03775f9dd58f5523ab36f07a2ce550b119e4923229e8bee683b68937 [2025-03-03 14:27:01,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:27:01,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:27:01,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:27:01,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:27:01,881 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:27:01,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product35.cil.c [2025-03-03 14:27:03,051 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd5ba885/8acc0540686f49d8a32f64a5d35de53e/FLAG9fa392ad7 [2025-03-03 14:27:03,373 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:27:03,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product35.cil.c [2025-03-03 14:27:03,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd5ba885/8acc0540686f49d8a32f64a5d35de53e/FLAG9fa392ad7 [2025-03-03 14:27:03,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bd5ba885/8acc0540686f49d8a32f64a5d35de53e [2025-03-03 14:27:03,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:27:03,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:27:03,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:27:03,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:27:03,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:27:03,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:27:03" (1/1) ... [2025-03-03 14:27:03,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6626b782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:03, skipping insertion in model container [2025-03-03 14:27:03,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:27:03" (1/1) ... [2025-03-03 14:27:03,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:27:03,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product35.cil.c[16425,16438] [2025-03-03 14:27:04,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:27:04,088 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:27:04,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-03-03 14:27:04,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [528] [2025-03-03 14:27:04,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [571] [2025-03-03 14:27:04,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [895] [2025-03-03 14:27:04,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [904] [2025-03-03 14:27:04,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [939] [2025-03-03 14:27:04,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1338] [2025-03-03 14:27:04,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1704] [2025-03-03 14:27:04,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2764] [2025-03-03 14:27:04,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2986] [2025-03-03 14:27:04,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3121] [2025-03-03 14:27:04,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product35.cil.c[16425,16438] [2025-03-03 14:27:04,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:27:04,218 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:27:04,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04 WrapperNode [2025-03-03 14:27:04,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:27:04,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:27:04,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:27:04,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:27:04,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,286 INFO L138 Inliner]: procedures = 138, calls = 230, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1164 [2025-03-03 14:27:04,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:27:04,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:27:04,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:27:04,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:27:04,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,330 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:27:04,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:27:04,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:27:04,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:27:04,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:27:04,378 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (1/1) ... [2025-03-03 14:27:04,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:27:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:04,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:27:04,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:27:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:27:04,426 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:27:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:27:04,426 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:27:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:27:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:27:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:27:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:27:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:27:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:27:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:27:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:27:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:27:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:27:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:27:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:27:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:27:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:27:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:27:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:27:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:27:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:27:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:27:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:27:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:27:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:27:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:27:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:27:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:27:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:27:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:27:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:27:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:27:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:27:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:27:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:27:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:27:04,430 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:27:04,430 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:27:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:27:04,432 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:27:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:27:04,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:27:04,619 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:27:04,626 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:27:04,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245: #res := ~retValue_acc~16; [2025-03-03 14:27:04,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L412: #res := ~retValue_acc~4; [2025-03-03 14:27:04,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2398: #res#1 := ~retValue_acc~33#1; [2025-03-03 14:27:04,762 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2353-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~32#1; [2025-03-03 14:27:04,794 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2622: #res := ~retValue_acc~36; [2025-03-03 14:27:04,802 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2306: #res := ~retValue_acc~31; [2025-03-03 14:27:04,813 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3118-1: createEmail_#res#1 := createEmail_~retValue_acc~42#1; [2025-03-03 14:27:04,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1850: #res := ~retValue_acc~25; [2025-03-03 14:27:04,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1171: #res := ~retValue_acc~14; [2025-03-03 14:27:04,881 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1208: #res := ~retValue_acc~15; [2025-03-03 14:27:04,894 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1282: #res := ~retValue_acc~17; [2025-03-03 14:27:04,912 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1056: #res := ~retValue_acc~11; [2025-03-03 14:27:04,968 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2176: #res := ~retValue_acc~29; [2025-03-03 14:27:05,095 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~30#1; [2025-03-03 14:27:05,096 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1319-1: isVerified_#res#1 := isVerified_~retValue_acc~18#1; [2025-03-03 14:27:05,096 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: getEmailId_#res#1 := getEmailId_~retValue_acc~9#1; [2025-03-03 14:27:05,096 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741-1: getClientId_#res#1 := getClientId_~retValue_acc~38#1; [2025-03-03 14:27:05,096 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2694-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~37#1; [2025-03-03 14:27:05,319 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L369-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~1#1; [2025-03-03 14:27:05,320 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L387-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~3#1; [2025-03-03 14:27:05,320 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~35#1; [2025-03-03 14:27:05,320 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L936-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-03-03 14:27:05,320 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L378-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~2#1; [2025-03-03 14:27:05,320 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2461-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~34#1; [2025-03-03 14:27:05,325 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: #res := ~retValue_acc~10; [2025-03-03 14:27:05,332 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~39#1; [2025-03-03 14:27:05,332 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094: #res#1 := ~retValue_acc~40#1; [2025-03-03 14:27:05,512 INFO L? ?]: Removed 610 outVars from TransFormulas that were not future-live. [2025-03-03 14:27:05,512 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:27:05,528 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:27:05,528 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:27:05,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:27:05 BoogieIcfgContainer [2025-03-03 14:27:05,528 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:27:05,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:27:05,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:27:05,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:27:05,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:27:03" (1/3) ... [2025-03-03 14:27:05,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec5c642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:27:05, skipping insertion in model container [2025-03-03 14:27:05,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:27:04" (2/3) ... [2025-03-03 14:27:05,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec5c642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:27:05, skipping insertion in model container [2025-03-03 14:27:05,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:27:05" (3/3) ... [2025-03-03 14:27:05,539 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product35.cil.c [2025-03-03 14:27:05,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:27:05,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product35.cil.c that has 30 procedures, 466 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:27:05,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:27:05,616 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;@6c902e60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:27:05,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:27:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 466 states, 360 states have (on average 1.5333333333333334) internal successors, (552), 365 states have internal predecessors, (552), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-03 14:27:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:27:05,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:05,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:05,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:05,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash -321042912, now seen corresponding path program 1 times [2025-03-03 14:27:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835137325] [2025-03-03 14:27:05,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:05,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:05,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:27:05,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:27:05,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:05,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:27:06,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:06,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835137325] [2025-03-03 14:27:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835137325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265257876] [2025-03-03 14:27:06,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:06,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:06,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:06,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:06,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:27:06,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:27:06,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:27:06,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:06,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:06,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:27:06,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:06,611 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:06,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265257876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:06,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:06,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:27:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104530288] [2025-03-03 14:27:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:06,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:27:06,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:06,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:27:06,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:06,639 INFO L87 Difference]: Start difference. First operand has 466 states, 360 states have (on average 1.5333333333333334) internal successors, (552), 365 states have internal predecessors, (552), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:06,703 INFO L93 Difference]: Finished difference Result 735 states and 1088 transitions. [2025-03-03 14:27:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:27:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-03-03 14:27:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:06,719 INFO L225 Difference]: With dead ends: 735 [2025-03-03 14:27:06,719 INFO L226 Difference]: Without dead ends: 459 [2025-03-03 14:27:06,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:06,726 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:06,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-03 14:27:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2025-03-03 14:27:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 354 states have (on average 1.5310734463276836) internal successors, (542), 358 states have internal predecessors, (542), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 14:27:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 691 transitions. [2025-03-03 14:27:06,803 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 691 transitions. Word has length 110 [2025-03-03 14:27:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:06,804 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 691 transitions. [2025-03-03 14:27:06,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 691 transitions. [2025-03-03 14:27:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:27:06,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:06,812 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:06,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:07,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:27:07,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:07,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:07,015 INFO L85 PathProgramCache]: Analyzing trace with hash 804297293, now seen corresponding path program 1 times [2025-03-03 14:27:07,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:07,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863624489] [2025-03-03 14:27:07,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:07,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:07,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:27:07,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:27:07,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:07,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:27:07,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863624489] [2025-03-03 14:27:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863624489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140855043] [2025-03-03 14:27:07,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:07,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:07,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:07,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:07,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:27:07,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:27:07,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:27:07,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:07,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:07,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:27:07,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:07,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140855043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:27:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550444384] [2025-03-03 14:27:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:07,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:07,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:07,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:07,635 INFO L87 Difference]: Start difference. First operand 459 states and 691 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:07,671 INFO L93 Difference]: Finished difference Result 724 states and 1066 transitions. [2025-03-03 14:27:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-03-03 14:27:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:07,677 INFO L225 Difference]: With dead ends: 724 [2025-03-03 14:27:07,677 INFO L226 Difference]: Without dead ends: 461 [2025-03-03 14:27:07,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:07,679 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 0 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:07,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1378 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-03 14:27:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2025-03-03 14:27:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 356 states have (on average 1.5280898876404494) internal successors, (544), 360 states have internal predecessors, (544), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 14:27:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 693 transitions. [2025-03-03 14:27:07,718 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 693 transitions. Word has length 111 [2025-03-03 14:27:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:07,719 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 693 transitions. [2025-03-03 14:27:07,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 693 transitions. [2025-03-03 14:27:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:27:07,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:07,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:07,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:07,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:27:07,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:07,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:07,931 INFO L85 PathProgramCache]: Analyzing trace with hash 364977873, now seen corresponding path program 1 times [2025-03-03 14:27:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:07,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464914777] [2025-03-03 14:27:07,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:07,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:07,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:27:07,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:27:07,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:07,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:08,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464914777] [2025-03-03 14:27:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464914777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:08,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645362634] [2025-03-03 14:27:08,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:08,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:08,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:08,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:08,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:27:08,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:27:08,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:27:08,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:08,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:08,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:27:08,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:27:08,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:08,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645362634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:08,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:08,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:27:08,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341453173] [2025-03-03 14:27:08,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:08,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:08,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:08,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:08,452 INFO L87 Difference]: Start difference. First operand 461 states and 693 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:08,506 INFO L93 Difference]: Finished difference Result 974 states and 1485 transitions. [2025-03-03 14:27:08,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:08,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-03 14:27:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:08,510 INFO L225 Difference]: With dead ends: 974 [2025-03-03 14:27:08,510 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 14:27:08,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:27:08,512 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 142 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:08,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1348 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 14:27:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 532. [2025-03-03 14:27:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 413 states have (on average 1.549636803874092) internal successors, (640), 417 states have internal predecessors, (640), 89 states have call successors, (89), 29 states have call predecessors, (89), 29 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 14:27:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 817 transitions. [2025-03-03 14:27:08,535 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 817 transitions. Word has length 119 [2025-03-03 14:27:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:08,535 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 817 transitions. [2025-03-03 14:27:08,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 817 transitions. [2025-03-03 14:27:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:27:08,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:08,538 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:08,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:27:08,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:08,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1413831362, now seen corresponding path program 1 times [2025-03-03 14:27:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548871555] [2025-03-03 14:27:08,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:08,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:08,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:27:08,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:27:08,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548871555] [2025-03-03 14:27:08,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548871555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167657670] [2025-03-03 14:27:08,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:08,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:08,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:08,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:08,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:27:09,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:27:09,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:27:09,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:09,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:09,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:27:09,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:27:09,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167657670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:09,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:09,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:27:09,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029074937] [2025-03-03 14:27:09,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:09,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:09,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:09,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:09,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:27:09,228 INFO L87 Difference]: Start difference. First operand 532 states and 817 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:09,287 INFO L93 Difference]: Finished difference Result 1055 states and 1624 transitions. [2025-03-03 14:27:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:09,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-03 14:27:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:09,293 INFO L225 Difference]: With dead ends: 1055 [2025-03-03 14:27:09,293 INFO L226 Difference]: Without dead ends: 534 [2025-03-03 14:27:09,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:27:09,297 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 2 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2721 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:09,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2721 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-03 14:27:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-03 14:27:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 419 states have internal predecessors, (641), 89 states have call successors, (89), 29 states have call predecessors, (89), 30 states have return successors, (90), 87 states have call predecessors, (90), 88 states have call successors, (90) [2025-03-03 14:27:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 820 transitions. [2025-03-03 14:27:09,317 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 820 transitions. Word has length 120 [2025-03-03 14:27:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:09,318 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 820 transitions. [2025-03-03 14:27:09,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 820 transitions. [2025-03-03 14:27:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:27:09,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:09,320 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:09,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:09,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:09,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1497369449, now seen corresponding path program 1 times [2025-03-03 14:27:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:09,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212148006] [2025-03-03 14:27:09,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:09,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:27:09,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:27:09,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:09,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:27:09,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212148006] [2025-03-03 14:27:09,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212148006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:09,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870514626] [2025-03-03 14:27:09,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:09,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:09,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:09,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:09,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:27:09,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:27:09,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:27:09,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:09,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:09,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:27:09,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:27:09,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:27:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870514626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:09,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:27:09,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:27:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573918107] [2025-03-03 14:27:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:09,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:09,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:09,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:09,974 INFO L87 Difference]: Start difference. First operand 534 states and 820 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:10,038 INFO L93 Difference]: Finished difference Result 1057 states and 1629 transitions. [2025-03-03 14:27:10,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-03-03 14:27:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:10,042 INFO L225 Difference]: With dead ends: 1057 [2025-03-03 14:27:10,042 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:27:10,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:10,045 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 2 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:10,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2707 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:27:10,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:27:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 415 states have (on average 1.546987951807229) internal successors, (642), 421 states have internal predecessors, (642), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (95), 87 states have call predecessors, (95), 88 states have call successors, (95) [2025-03-03 14:27:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 826 transitions. [2025-03-03 14:27:10,069 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 826 transitions. Word has length 121 [2025-03-03 14:27:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:10,069 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 826 transitions. [2025-03-03 14:27:10,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 826 transitions. [2025-03-03 14:27:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:27:10,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:10,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:10,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:10,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:10,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:10,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash -82777023, now seen corresponding path program 1 times [2025-03-03 14:27:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337318312] [2025-03-03 14:27:10,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:10,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:27:10,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:27:10,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:10,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:27:10,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:10,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337318312] [2025-03-03 14:27:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337318312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:10,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:10,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:10,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145949680] [2025-03-03 14:27:10,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:10,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:10,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:10,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:10,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:10,407 INFO L87 Difference]: Start difference. First operand 536 states and 826 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:10,451 INFO L93 Difference]: Finished difference Result 1049 states and 1620 transitions. [2025-03-03 14:27:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:10,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-03-03 14:27:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:10,455 INFO L225 Difference]: With dead ends: 1049 [2025-03-03 14:27:10,455 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:27:10,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:10,458 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 2 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:10,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2725 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:27:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:27:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 415 states have (on average 1.546987951807229) internal successors, (642), 421 states have internal predecessors, (642), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (94), 87 states have call predecessors, (94), 88 states have call successors, (94) [2025-03-03 14:27:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 825 transitions. [2025-03-03 14:27:10,479 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 825 transitions. Word has length 122 [2025-03-03 14:27:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:10,479 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 825 transitions. [2025-03-03 14:27:10,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 825 transitions. [2025-03-03 14:27:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:27:10,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:10,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:10,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:27:10,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:10,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1712922422, now seen corresponding path program 2 times [2025-03-03 14:27:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769638502] [2025-03-03 14:27:10,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:27:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:10,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-03 14:27:10,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:27:10,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:27:10,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769638502] [2025-03-03 14:27:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769638502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:10,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038701244] [2025-03-03 14:27:10,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:10,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:10,621 INFO L87 Difference]: Start difference. First operand 536 states and 825 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:10,686 INFO L93 Difference]: Finished difference Result 1047 states and 1615 transitions. [2025-03-03 14:27:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-03 14:27:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:10,694 INFO L225 Difference]: With dead ends: 1047 [2025-03-03 14:27:10,694 INFO L226 Difference]: Without dead ends: 536 [2025-03-03 14:27:10,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:10,697 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 2 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:10,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2711 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-03 14:27:10,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-03 14:27:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 415 states have (on average 1.546987951807229) internal successors, (642), 421 states have internal predecessors, (642), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (93), 87 states have call predecessors, (93), 88 states have call successors, (93) [2025-03-03 14:27:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 824 transitions. [2025-03-03 14:27:10,742 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 824 transitions. Word has length 123 [2025-03-03 14:27:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:10,743 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 824 transitions. [2025-03-03 14:27:10,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 824 transitions. [2025-03-03 14:27:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:27:10,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:10,747 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-03-03 14:27:10,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:27:10,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:10,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:10,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2130945472, now seen corresponding path program 3 times [2025-03-03 14:27:10,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:10,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346835092] [2025-03-03 14:27:10,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:27:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:10,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 124 statements into 3 equivalence classes. [2025-03-03 14:27:10,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 112 of 124 statements. [2025-03-03 14:27:10,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:27:10,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:10,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:10,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346835092] [2025-03-03 14:27:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346835092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:10,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:10,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480123935] [2025-03-03 14:27:10,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:10,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:10,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:10,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:10,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:10,866 INFO L87 Difference]: Start difference. First operand 536 states and 824 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:10,917 INFO L93 Difference]: Finished difference Result 1049 states and 1621 transitions. [2025-03-03 14:27:10,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:10,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 124 [2025-03-03 14:27:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:10,921 INFO L225 Difference]: With dead ends: 1049 [2025-03-03 14:27:10,921 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 14:27:10,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:10,924 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 1 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:10,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2722 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 14:27:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-03-03 14:27:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 423 states have internal predecessors, (643), 89 states have call successors, (89), 29 states have call predecessors, (89), 32 states have return successors, (98), 87 states have call predecessors, (98), 88 states have call successors, (98) [2025-03-03 14:27:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 830 transitions. [2025-03-03 14:27:10,944 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 830 transitions. Word has length 124 [2025-03-03 14:27:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:10,944 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 830 transitions. [2025-03-03 14:27:10,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 830 transitions. [2025-03-03 14:27:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:27:10,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:10,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:10,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:27:10,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:10,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash 490288679, now seen corresponding path program 1 times [2025-03-03 14:27:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:10,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091726960] [2025-03-03 14:27:10,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:10,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:10,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:27:10,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:27:10,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:10,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:27:11,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:11,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091726960] [2025-03-03 14:27:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091726960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:11,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:11,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:27:11,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50609828] [2025-03-03 14:27:11,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:11,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:27:11,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:11,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:27:11,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:11,060 INFO L87 Difference]: Start difference. First operand 538 states and 830 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:11,111 INFO L93 Difference]: Finished difference Result 1055 states and 1631 transitions. [2025-03-03 14:27:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:27:11,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-03-03 14:27:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:11,116 INFO L225 Difference]: With dead ends: 1055 [2025-03-03 14:27:11,116 INFO L226 Difference]: Without dead ends: 540 [2025-03-03 14:27:11,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:27:11,118 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 1 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:11,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2728 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-03 14:27:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-03-03 14:27:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 417 states have (on average 1.5443645083932853) internal successors, (644), 425 states have internal predecessors, (644), 89 states have call successors, (89), 29 states have call predecessors, (89), 33 states have return successors, (100), 87 states have call predecessors, (100), 88 states have call successors, (100) [2025-03-03 14:27:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 833 transitions. [2025-03-03 14:27:11,137 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 833 transitions. Word has length 125 [2025-03-03 14:27:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:11,138 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 833 transitions. [2025-03-03 14:27:11,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:27:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 833 transitions. [2025-03-03 14:27:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:27:11,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:11,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:11,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:27:11,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:11,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1391930725, now seen corresponding path program 1 times [2025-03-03 14:27:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9254117] [2025-03-03 14:27:11,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:11,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:27:11,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:27:11,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:11,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:27:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9254117] [2025-03-03 14:27:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9254117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:27:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936384944] [2025-03-03 14:27:11,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:11,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:27:11,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:27:11,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:27:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:27:11,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:27:11,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:11,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:11,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:27:11,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:27:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:11,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:27:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:11,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936384944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:27:11,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:27:11,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:27:11,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757698820] [2025-03-03 14:27:11,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:27:11,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:27:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:11,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:27:11,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:27:11,682 INFO L87 Difference]: Start difference. First operand 540 states and 833 transitions. Second operand has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-03 14:27:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:12,322 INFO L93 Difference]: Finished difference Result 1515 states and 2436 transitions. [2025-03-03 14:27:12,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:27:12,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 126 [2025-03-03 14:27:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:12,328 INFO L225 Difference]: With dead ends: 1515 [2025-03-03 14:27:12,328 INFO L226 Difference]: Without dead ends: 1004 [2025-03-03 14:27:12,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:27:12,331 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 1748 mSDsluCounter, 3634 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 4319 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:12,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 4319 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:27:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-03-03 14:27:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 980. [2025-03-03 14:27:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 778 states have (on average 1.6028277634961439) internal successors, (1247), 785 states have internal predecessors, (1247), 168 states have call successors, (168), 30 states have call predecessors, (168), 33 states have return successors, (189), 166 states have call predecessors, (189), 167 states have call successors, (189) [2025-03-03 14:27:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1604 transitions. [2025-03-03 14:27:12,372 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1604 transitions. Word has length 126 [2025-03-03 14:27:12,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:12,373 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1604 transitions. [2025-03-03 14:27:12,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.7) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-03 14:27:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1604 transitions. [2025-03-03 14:27:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:27:12,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:12,378 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:12,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:27:12,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:27:12,582 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:12,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1573783179, now seen corresponding path program 1 times [2025-03-03 14:27:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:12,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354910355] [2025-03-03 14:27:12,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:12,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:27:12,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:27:12,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:12,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354910355] [2025-03-03 14:27:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354910355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:12,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:12,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342992296] [2025-03-03 14:27:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:12,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:12,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:12,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:12,670 INFO L87 Difference]: Start difference. First operand 980 states and 1604 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:12,736 INFO L93 Difference]: Finished difference Result 2300 states and 3826 transitions. [2025-03-03 14:27:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-03-03 14:27:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:12,745 INFO L225 Difference]: With dead ends: 2300 [2025-03-03 14:27:12,746 INFO L226 Difference]: Without dead ends: 1398 [2025-03-03 14:27:12,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-03-03 14:27:12,751 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 139 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:12,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1393 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-03 14:27:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1390. [2025-03-03 14:27:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1109 states have (on average 1.6248872858431018) internal successors, (1802), 1116 states have internal predecessors, (1802), 247 states have call successors, (247), 30 states have call predecessors, (247), 33 states have return successors, (278), 245 states have call predecessors, (278), 246 states have call successors, (278) [2025-03-03 14:27:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2327 transitions. [2025-03-03 14:27:12,822 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2327 transitions. Word has length 129 [2025-03-03 14:27:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:12,822 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2327 transitions. [2025-03-03 14:27:12,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2327 transitions. [2025-03-03 14:27:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:27:12,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:12,830 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:12,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:27:12,830 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:12,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:12,830 INFO L85 PathProgramCache]: Analyzing trace with hash -336857901, now seen corresponding path program 1 times [2025-03-03 14:27:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:12,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186513080] [2025-03-03 14:27:12,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:12,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:12,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:27:12,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:27:12,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:12,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:12,888 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:12,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186513080] [2025-03-03 14:27:12,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186513080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:12,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:12,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559733105] [2025-03-03 14:27:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:12,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:12,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:12,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:12,889 INFO L87 Difference]: Start difference. First operand 1390 states and 2327 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:12,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:12,952 INFO L93 Difference]: Finished difference Result 3328 states and 5612 transitions. [2025-03-03 14:27:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:12,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-03 14:27:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:12,965 INFO L225 Difference]: With dead ends: 3328 [2025-03-03 14:27:12,965 INFO L226 Difference]: Without dead ends: 2067 [2025-03-03 14:27:12,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:12,972 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 137 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:12,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1374 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-03-03 14:27:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2059. [2025-03-03 14:27:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 1659 states have (on average 1.6371308016877637) internal successors, (2716), 1666 states have internal predecessors, (2716), 366 states have call successors, (366), 30 states have call predecessors, (366), 33 states have return successors, (397), 364 states have call predecessors, (397), 365 states have call successors, (397) [2025-03-03 14:27:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 3479 transitions. [2025-03-03 14:27:13,058 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 3479 transitions. Word has length 130 [2025-03-03 14:27:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:13,058 INFO L471 AbstractCegarLoop]: Abstraction has 2059 states and 3479 transitions. [2025-03-03 14:27:13,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 3479 transitions. [2025-03-03 14:27:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:27:13,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:13,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:13,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:27:13,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:13,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash -194137782, now seen corresponding path program 1 times [2025-03-03 14:27:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:13,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209442677] [2025-03-03 14:27:13,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:13,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:27:13,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:27:13,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:13,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:13,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:13,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209442677] [2025-03-03 14:27:13,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209442677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:13,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:13,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:13,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095440160] [2025-03-03 14:27:13,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:13,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:13,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:13,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:13,130 INFO L87 Difference]: Start difference. First operand 2059 states and 3479 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:13,249 INFO L93 Difference]: Finished difference Result 4895 states and 8339 transitions. [2025-03-03 14:27:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:13,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-03-03 14:27:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:13,267 INFO L225 Difference]: With dead ends: 4895 [2025-03-03 14:27:13,267 INFO L226 Difference]: Without dead ends: 3097 [2025-03-03 14:27:13,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:13,275 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 135 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:13,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1369 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2025-03-03 14:27:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3089. [2025-03-03 14:27:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 2527 states have (on average 1.6466165413533835) internal successors, (4161), 2534 states have internal predecessors, (4161), 528 states have call successors, (528), 30 states have call predecessors, (528), 33 states have return successors, (575), 526 states have call predecessors, (575), 527 states have call successors, (575) [2025-03-03 14:27:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 5264 transitions. [2025-03-03 14:27:13,423 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 5264 transitions. Word has length 131 [2025-03-03 14:27:13,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:13,424 INFO L471 AbstractCegarLoop]: Abstraction has 3089 states and 5264 transitions. [2025-03-03 14:27:13,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 5264 transitions. [2025-03-03 14:27:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:27:13,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:13,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:13,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:27:13,438 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:13,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838348, now seen corresponding path program 1 times [2025-03-03 14:27:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:13,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887960350] [2025-03-03 14:27:13,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:13,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:27:13,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:27:13,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:13,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:13,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:13,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887960350] [2025-03-03 14:27:13,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887960350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:13,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:13,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574236485] [2025-03-03 14:27:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:13,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:13,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:13,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:13,487 INFO L87 Difference]: Start difference. First operand 3089 states and 5264 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:13,623 INFO L93 Difference]: Finished difference Result 7378 states and 12666 transitions. [2025-03-03 14:27:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:13,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-03 14:27:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:13,652 INFO L225 Difference]: With dead ends: 7378 [2025-03-03 14:27:13,652 INFO L226 Difference]: Without dead ends: 4765 [2025-03-03 14:27:13,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:13,666 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 133 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:13,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1369 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4765 states. [2025-03-03 14:27:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4765 to 4757. [2025-03-03 14:27:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4757 states, 3950 states have (on average 1.6534177215189874) internal successors, (6531), 3957 states have internal predecessors, (6531), 773 states have call successors, (773), 30 states have call predecessors, (773), 33 states have return successors, (846), 771 states have call predecessors, (846), 772 states have call successors, (846) [2025-03-03 14:27:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4757 states and 8150 transitions. [2025-03-03 14:27:13,969 INFO L78 Accepts]: Start accepts. Automaton has 4757 states and 8150 transitions. Word has length 132 [2025-03-03 14:27:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:13,970 INFO L471 AbstractCegarLoop]: Abstraction has 4757 states and 8150 transitions. [2025-03-03 14:27:13,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4757 states and 8150 transitions. [2025-03-03 14:27:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:27:13,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:13,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:13,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:27:13,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:13,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1684579031, now seen corresponding path program 1 times [2025-03-03 14:27:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031765394] [2025-03-03 14:27:13,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:14,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:27:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:27:14,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:14,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:14,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:14,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031765394] [2025-03-03 14:27:14,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031765394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:14,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:14,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:14,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704563176] [2025-03-03 14:27:14,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:14,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:14,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:14,051 INFO L87 Difference]: Start difference. First operand 4757 states and 8150 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:14,274 INFO L93 Difference]: Finished difference Result 11523 states and 19887 transitions. [2025-03-03 14:27:14,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-03-03 14:27:14,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:14,323 INFO L225 Difference]: With dead ends: 11523 [2025-03-03 14:27:14,323 INFO L226 Difference]: Without dead ends: 7569 [2025-03-03 14:27:14,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:14,341 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 131 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:14,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1386 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:14,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7569 states. [2025-03-03 14:27:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7569 to 7561. [2025-03-03 14:27:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7561 states, 6261 states have (on average 1.653250279508066) internal successors, (10351), 6268 states have internal predecessors, (10351), 1266 states have call successors, (1266), 30 states have call predecessors, (1266), 33 states have return successors, (1383), 1264 states have call predecessors, (1383), 1265 states have call successors, (1383) [2025-03-03 14:27:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7561 states to 7561 states and 13000 transitions. [2025-03-03 14:27:14,694 INFO L78 Accepts]: Start accepts. Automaton has 7561 states and 13000 transitions. Word has length 133 [2025-03-03 14:27:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:14,695 INFO L471 AbstractCegarLoop]: Abstraction has 7561 states and 13000 transitions. [2025-03-03 14:27:14,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7561 states and 13000 transitions. [2025-03-03 14:27:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:27:14,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:14,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:14,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:27:14,720 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:14,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash -708429675, now seen corresponding path program 1 times [2025-03-03 14:27:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:14,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504329560] [2025-03-03 14:27:14,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:14,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:27:14,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:27:14,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:14,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:14,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504329560] [2025-03-03 14:27:14,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504329560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:14,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:14,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:14,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546731404] [2025-03-03 14:27:14,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:14,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:14,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:14,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:14,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:14,779 INFO L87 Difference]: Start difference. First operand 7561 states and 13000 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:15,129 INFO L93 Difference]: Finished difference Result 19033 states and 32947 transitions. [2025-03-03 14:27:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:15,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-03-03 14:27:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:15,193 INFO L225 Difference]: With dead ends: 19033 [2025-03-03 14:27:15,194 INFO L226 Difference]: Without dead ends: 12671 [2025-03-03 14:27:15,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:15,227 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 129 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:15,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1374 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12671 states. [2025-03-03 14:27:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12671 to 12663. [2025-03-03 14:27:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12663 states, 10541 states have (on average 1.6546817190019922) internal successors, (17442), 10548 states have internal predecessors, (17442), 2088 states have call successors, (2088), 30 states have call predecessors, (2088), 33 states have return successors, (2283), 2086 states have call predecessors, (2283), 2087 states have call successors, (2283) [2025-03-03 14:27:15,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12663 states to 12663 states and 21813 transitions. [2025-03-03 14:27:15,765 INFO L78 Accepts]: Start accepts. Automaton has 12663 states and 21813 transitions. Word has length 134 [2025-03-03 14:27:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:15,766 INFO L471 AbstractCegarLoop]: Abstraction has 12663 states and 21813 transitions. [2025-03-03 14:27:15,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 12663 states and 21813 transitions. [2025-03-03 14:27:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:27:15,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:15,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:15,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:27:15,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:15,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:15,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1788327128, now seen corresponding path program 1 times [2025-03-03 14:27:15,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:15,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661603397] [2025-03-03 14:27:15,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:15,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:15,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:27:15,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:27:15,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:15,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661603397] [2025-03-03 14:27:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661603397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:15,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791796635] [2025-03-03 14:27:15,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:15,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:15,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:15,856 INFO L87 Difference]: Start difference. First operand 12663 states and 21813 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:16,285 INFO L93 Difference]: Finished difference Result 30314 states and 52164 transitions. [2025-03-03 14:27:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:16,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-03-03 14:27:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:16,397 INFO L225 Difference]: With dead ends: 30314 [2025-03-03 14:27:16,397 INFO L226 Difference]: Without dead ends: 19847 [2025-03-03 14:27:16,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:16,441 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 127 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:16,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1352 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19847 states. [2025-03-03 14:27:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19847 to 19839. [2025-03-03 14:27:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19839 states, 16514 states have (on average 1.6320092043114933) internal successors, (26951), 16521 states have internal predecessors, (26951), 3291 states have call successors, (3291), 30 states have call predecessors, (3291), 33 states have return successors, (3630), 3289 states have call predecessors, (3630), 3290 states have call successors, (3630) [2025-03-03 14:27:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19839 states to 19839 states and 33872 transitions. [2025-03-03 14:27:17,234 INFO L78 Accepts]: Start accepts. Automaton has 19839 states and 33872 transitions. Word has length 135 [2025-03-03 14:27:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:17,234 INFO L471 AbstractCegarLoop]: Abstraction has 19839 states and 33872 transitions. [2025-03-03 14:27:17,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 19839 states and 33872 transitions. [2025-03-03 14:27:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:27:17,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:17,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:17,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:27:17,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:17,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash 490544374, now seen corresponding path program 1 times [2025-03-03 14:27:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:17,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249137181] [2025-03-03 14:27:17,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:17,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:27:17,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:27:17,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:17,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:17,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249137181] [2025-03-03 14:27:17,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249137181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:17,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:17,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576358582] [2025-03-03 14:27:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:17,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:17,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:17,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:17,333 INFO L87 Difference]: Start difference. First operand 19839 states and 33872 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:18,339 INFO L93 Difference]: Finished difference Result 52361 states and 89763 transitions. [2025-03-03 14:27:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:18,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-03 14:27:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:18,472 INFO L225 Difference]: With dead ends: 52361 [2025-03-03 14:27:18,472 INFO L226 Difference]: Without dead ends: 35387 [2025-03-03 14:27:18,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:18,511 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 125 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:18,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1372 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35387 states. [2025-03-03 14:27:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35387 to 35379. [2025-03-03 14:27:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35379 states, 29604 states have (on average 1.6297459802729362) internal successors, (48247), 29611 states have internal predecessors, (48247), 5741 states have call successors, (5741), 30 states have call predecessors, (5741), 33 states have return successors, (6354), 5739 states have call predecessors, (6354), 5740 states have call successors, (6354) [2025-03-03 14:27:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35379 states to 35379 states and 60342 transitions. [2025-03-03 14:27:19,745 INFO L78 Accepts]: Start accepts. Automaton has 35379 states and 60342 transitions. Word has length 136 [2025-03-03 14:27:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:19,745 INFO L471 AbstractCegarLoop]: Abstraction has 35379 states and 60342 transitions. [2025-03-03 14:27:19,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 35379 states and 60342 transitions. [2025-03-03 14:27:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:27:19,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:19,782 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:19,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:27:19,783 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:19,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1921114183, now seen corresponding path program 1 times [2025-03-03 14:27:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:19,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085646605] [2025-03-03 14:27:19,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:19,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:19,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:27:19,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:27:19,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:19,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:19,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:19,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085646605] [2025-03-03 14:27:19,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085646605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:19,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:19,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:19,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20446035] [2025-03-03 14:27:19,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:19,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:19,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:19,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:19,845 INFO L87 Difference]: Start difference. First operand 35379 states and 60342 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:21,299 INFO L93 Difference]: Finished difference Result 96428 states and 165010 transitions. [2025-03-03 14:27:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-03 14:27:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:21,634 INFO L225 Difference]: With dead ends: 96428 [2025-03-03 14:27:21,634 INFO L226 Difference]: Without dead ends: 64861 [2025-03-03 14:27:21,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:21,745 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 123 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:21,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1380 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64861 states. [2025-03-03 14:27:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64861 to 64853. [2025-03-03 14:27:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64853 states, 54565 states have (on average 1.6262622560249245) internal successors, (88737), 54572 states have internal predecessors, (88737), 10254 states have call successors, (10254), 30 states have call predecessors, (10254), 33 states have return successors, (11399), 10252 states have call predecessors, (11399), 10253 states have call successors, (11399) [2025-03-03 14:27:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64853 states to 64853 states and 110390 transitions. [2025-03-03 14:27:24,858 INFO L78 Accepts]: Start accepts. Automaton has 64853 states and 110390 transitions. Word has length 137 [2025-03-03 14:27:24,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:24,859 INFO L471 AbstractCegarLoop]: Abstraction has 64853 states and 110390 transitions. [2025-03-03 14:27:24,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 64853 states and 110390 transitions. [2025-03-03 14:27:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 14:27:24,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:24,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:24,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:27:24,906 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:24,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:24,906 INFO L85 PathProgramCache]: Analyzing trace with hash -84110857, now seen corresponding path program 1 times [2025-03-03 14:27:24,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:24,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162701786] [2025-03-03 14:27:24,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:24,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:24,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:27:24,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:27:24,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:24,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:25,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:25,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162701786] [2025-03-03 14:27:25,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162701786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:25,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:25,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:27:25,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915852218] [2025-03-03 14:27:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:25,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:27:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:25,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:27:25,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:25,391 INFO L87 Difference]: Start difference. First operand 64853 states and 110390 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:27,484 INFO L93 Difference]: Finished difference Result 121579 states and 207364 transitions. [2025-03-03 14:27:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:27:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-03-03 14:27:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:27,987 INFO L225 Difference]: With dead ends: 121579 [2025-03-03 14:27:27,987 INFO L226 Difference]: Without dead ends: 121316 [2025-03-03 14:27:28,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:27:28,044 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 118 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:28,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1378 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:27:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121316 states. [2025-03-03 14:27:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121316 to 121308. [2025-03-03 14:27:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121308 states, 102652 states have (on average 1.6215563262284223) internal successors, (166456), 102659 states have internal predecessors, (166456), 18622 states have call successors, (18622), 30 states have call predecessors, (18622), 33 states have return successors, (20813), 18620 states have call predecessors, (20813), 18621 states have call successors, (20813) [2025-03-03 14:27:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121308 states to 121308 states and 205891 transitions. [2025-03-03 14:27:32,439 INFO L78 Accepts]: Start accepts. Automaton has 121308 states and 205891 transitions. Word has length 138 [2025-03-03 14:27:32,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:27:32,440 INFO L471 AbstractCegarLoop]: Abstraction has 121308 states and 205891 transitions. [2025-03-03 14:27:32,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:27:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 121308 states and 205891 transitions. [2025-03-03 14:27:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:27:32,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:27:32,500 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:27:32,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:27:32,500 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:27:32,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:27:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1317825242, now seen corresponding path program 1 times [2025-03-03 14:27:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:27:32,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56396127] [2025-03-03 14:27:32,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:27:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:27:32,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:27:32,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:27:32,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:27:32,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:27:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:27:32,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:27:32,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56396127] [2025-03-03 14:27:32,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56396127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:27:32,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:27:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 14:27:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209865324] [2025-03-03 14:27:32,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:27:32,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:27:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:27:32,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:27:32,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:27:32,866 INFO L87 Difference]: Start difference. First operand 121308 states and 205891 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 14:27:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:27:38,950 INFO L93 Difference]: Finished difference Result 241983 states and 416131 transitions. [2025-03-03 14:27:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 14:27:38,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 139 [2025-03-03 14:27:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:27:40,125 INFO L225 Difference]: With dead ends: 241983 [2025-03-03 14:27:40,125 INFO L226 Difference]: Without dead ends: 241726 [2025-03-03 14:27:40,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:27:40,216 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 2091 mSDsluCounter, 8533 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 9347 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:27:40,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 9347 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 14:27:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241726 states.