./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product24.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 b453d764da4cb622a1911439b5a79bae9155e32b42a83c5d4472e5a8d62a8d39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:29:41,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:29:41,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:29:41,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:29:41,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:29:41,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:29:41,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:29:41,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:29:41,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:29:41,511 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:29:41,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:29:41,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:29:41,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:29:41,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:29:41,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:29:41,512 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:29:41,513 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:41,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:29:41,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:29:41,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:29:41,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:29:41,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:29:41,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:29:41,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:29:41,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:29:41,514 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 -> b453d764da4cb622a1911439b5a79bae9155e32b42a83c5d4472e5a8d62a8d39 [2025-03-08 05:29:41,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:29:41,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:29:41,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:29:41,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:29:41,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:29:41,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product24.cil.c [2025-03-08 05:29:42,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71814fd46/b5ece6fcdda346c4b1c1b9ef40b246c3/FLAG6701b79ad [2025-03-08 05:29:43,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:29:43,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product24.cil.c [2025-03-08 05:29:43,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71814fd46/b5ece6fcdda346c4b1c1b9ef40b246c3/FLAG6701b79ad [2025-03-08 05:29:43,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71814fd46/b5ece6fcdda346c4b1c1b9ef40b246c3 [2025-03-08 05:29:43,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:29:43,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:29:43,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:43,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:29:43,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:29:43,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64193d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43, skipping insertion in model container [2025-03-08 05:29:43,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:29:43,562 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_spec0_product24.cil.c[25283,25296] [2025-03-08 05:29:43,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:43,697 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:29:43,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-08 05:29:43,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [460] [2025-03-08 05:29:43,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [689] [2025-03-08 05:29:43,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1036] [2025-03-08 05:29:43,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1332] [2025-03-08 05:29:43,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1341] [2025-03-08 05:29:43,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1707] [2025-03-08 05:29:43,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1803] [2025-03-08 05:29:43,705 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1822] [2025-03-08 05:29:43,706 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1857] [2025-03-08 05:29:43,706 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2922] [2025-03-08 05:29:43,757 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_spec0_product24.cil.c[25283,25296] [2025-03-08 05:29:43,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:43,827 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:29:43,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43 WrapperNode [2025-03-08 05:29:43,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:43,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:43,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:29:43,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:29:43,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,903 INFO L138 Inliner]: procedures = 130, calls = 192, calls flagged for inlining = 64, calls inlined = 59, statements flattened = 1052 [2025-03-08 05:29:43,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:43,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:29:43,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:29:43,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:29:43,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,950 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:29:43,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:29:43,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:29:43,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:29:43,972 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:29:43,973 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 05:29:43,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:43,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:43,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:29:44,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:29:44,016 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:29:44,016 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:29:44,016 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:29:44,016 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:29:44,016 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:29:44,016 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:29:44,017 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:29:44,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:29:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:29:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:29:44,018 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:29:44,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:29:44,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:29:44,171 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:29:44,174 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:29:44,215 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: #res := ~retValue_acc~9; [2025-03-08 05:29:44,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2852-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~40#1; [2025-03-08 05:29:44,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~34#1; [2025-03-08 05:29:44,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L441-1: isVerified_#res#1 := isVerified_~retValue_acc~10#1; [2025-03-08 05:29:44,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-08 05:29:44,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~39#1; [2025-03-08 05:29:44,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~33#1; [2025-03-08 05:29:44,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L924-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~15#1; [2025-03-08 05:29:44,498 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2899-1: getClientId_#res#1 := getClientId_~retValue_acc~41#1; [2025-03-08 05:29:44,503 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: #res := ~retValue_acc~8; [2025-03-08 05:29:44,526 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-08 05:29:44,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2556: #res#1 := ~retValue_acc~36#1; [2025-03-08 05:29:44,547 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2511-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~35#1; [2025-03-08 05:29:44,576 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1800-1: createEmail_#res#1 := createEmail_~retValue_acc~22#1; [2025-03-08 05:29:44,797 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1854-1: valid_product_#res#1 := valid_product_~retValue_acc~24#1; [2025-03-08 05:29:44,797 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L881-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~12#1; [2025-03-08 05:29:44,797 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L890-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~13#1; [2025-03-08 05:29:44,797 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L899-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~14#1; [2025-03-08 05:29:44,797 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2726-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~38#1; [2025-03-08 05:29:44,797 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2619-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~37#1; [2025-03-08 05:29:44,802 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-08 05:29:44,803 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1776: #res := ~retValue_acc~20; [2025-03-08 05:29:44,887 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2025-03-08 05:29:44,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:29:44,900 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:29:44,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:29:44,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:44 BoogieIcfgContainer [2025-03-08 05:29:44,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:29:44,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:29:44,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:29:44,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:29:44,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:43" (1/3) ... [2025-03-08 05:29:44,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188ae5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:44, skipping insertion in model container [2025-03-08 05:29:44,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (2/3) ... [2025-03-08 05:29:44,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188ae5f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:44, skipping insertion in model container [2025-03-08 05:29:44,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:44" (3/3) ... [2025-03-08 05:29:44,907 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product24.cil.c [2025-03-08 05:29:44,917 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:29:44,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product24.cil.c that has 18 procedures, 318 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:29:44,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:29:44,972 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;@6404cda8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:29:44,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:29:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 253 states have (on average 1.533596837944664) internal successors, (388), 255 states have internal predecessors, (388), 46 states have call successors, (46), 17 states have call predecessors, (46), 17 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 05:29:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:29:44,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:44,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:44,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:44,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash 413289785, now seen corresponding path program 1 times [2025-03-08 05:29:44,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:44,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112825706] [2025-03-08 05:29:44,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:45,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:29:45,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:29:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:45,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:45,581 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:29:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:45,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112825706] [2025-03-08 05:29:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112825706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263848628] [2025-03-08 05:29:45,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:45,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:45,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:45,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:45,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:29:45,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:29:45,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:29:45,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:45,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:45,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:29:45,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:29:45,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263848628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:45,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:45,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604968294] [2025-03-08 05:29:45,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:45,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:45,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:45,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:45,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:45,899 INFO L87 Difference]: Start difference. First operand has 318 states, 253 states have (on average 1.533596837944664) internal successors, (388), 255 states have internal predecessors, (388), 46 states have call successors, (46), 17 states have call predecessors, (46), 17 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:29:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:45,955 INFO L93 Difference]: Finished difference Result 480 states and 712 transitions. [2025-03-08 05:29:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:45,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-03-08 05:29:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:45,972 INFO L225 Difference]: With dead ends: 480 [2025-03-08 05:29:45,973 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 05:29:45,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:45,980 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:45,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 949 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 05:29:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2025-03-08 05:29:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 248 states have (on average 1.528225806451613) internal successors, (379), 249 states have internal predecessors, (379), 46 states have call successors, (46), 17 states have call predecessors, (46), 17 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 05:29:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 470 transitions. [2025-03-08 05:29:46,045 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 470 transitions. Word has length 108 [2025-03-08 05:29:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:46,047 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 470 transitions. [2025-03-08 05:29:46,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:29:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 470 transitions. [2025-03-08 05:29:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:29:46,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:46,051 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:46,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:29:46,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:29:46,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:46,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash 510998317, now seen corresponding path program 1 times [2025-03-08 05:29:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:46,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978852152] [2025-03-08 05:29:46,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:46,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:46,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:29:46,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:29:46,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:46,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:29:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978852152] [2025-03-08 05:29:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978852152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917159072] [2025-03-08 05:29:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:46,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:46,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:46,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:46,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:29:46,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:29:46,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:29:46,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:46,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:46,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:46,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:29:46,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917159072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:46,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:46,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:46,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937519332] [2025-03-08 05:29:46,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:46,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:46,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:46,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:46,757 INFO L87 Difference]: Start difference. First operand 312 states and 470 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:29:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:46,787 INFO L93 Difference]: Finished difference Result 658 states and 1006 transitions. [2025-03-08 05:29:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:46,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-08 05:29:46,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:46,790 INFO L225 Difference]: With dead ends: 658 [2025-03-08 05:29:46,793 INFO L226 Difference]: Without dead ends: 372 [2025-03-08 05:29:46,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:46,795 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 115 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:46,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 903 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-08 05:29:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2025-03-08 05:29:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 289 states have (on average 1.546712802768166) internal successors, (447), 290 states have internal predecessors, (447), 57 states have call successors, (57), 17 states have call predecessors, (57), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 05:29:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 560 transitions. [2025-03-08 05:29:46,827 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 560 transitions. Word has length 115 [2025-03-08 05:29:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:46,828 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 560 transitions. [2025-03-08 05:29:46,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:29:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 560 transitions. [2025-03-08 05:29:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:29:46,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:46,832 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-08 05:29:46,841 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-08 05:29:47,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:29:47,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:47,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:47,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1413775448, now seen corresponding path program 1 times [2025-03-08 05:29:47,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:47,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359391845] [2025-03-08 05:29:47,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:47,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:29:47,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:29:47,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:47,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:29:47,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359391845] [2025-03-08 05:29:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359391845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580577390] [2025-03-08 05:29:47,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:47,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:47,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:47,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:47,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:29:47,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:29:47,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:29:47,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:47,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:29:47,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:29:47,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580577390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:47,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:29:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226136760] [2025-03-08 05:29:47,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:47,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:47,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:47,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:47,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:47,514 INFO L87 Difference]: Start difference. First operand 364 states and 560 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:29:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:47,570 INFO L93 Difference]: Finished difference Result 719 states and 1110 transitions. [2025-03-08 05:29:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-03-08 05:29:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:47,574 INFO L225 Difference]: With dead ends: 719 [2025-03-08 05:29:47,576 INFO L226 Difference]: Without dead ends: 366 [2025-03-08 05:29:47,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:47,578 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:47,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1833 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-08 05:29:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-08 05:29:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 290 states have (on average 1.5448275862068965) internal successors, (448), 292 states have internal predecessors, (448), 57 states have call successors, (57), 17 states have call predecessors, (57), 18 states have return successors, (58), 56 states have call predecessors, (58), 56 states have call successors, (58) [2025-03-08 05:29:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2025-03-08 05:29:47,601 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 116 [2025-03-08 05:29:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:47,603 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2025-03-08 05:29:47,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:29:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2025-03-08 05:29:47,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:29:47,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:47,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:47,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:47,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:47,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:47,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash -381066260, now seen corresponding path program 1 times [2025-03-08 05:29:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:47,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912699780] [2025-03-08 05:29:47,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:47,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:29:47,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:29:47,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:47,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:29:47,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:47,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912699780] [2025-03-08 05:29:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912699780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:47,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264448758] [2025-03-08 05:29:47,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:47,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:47,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:47,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:47,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:29:48,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:29:48,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:29:48,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:48,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:48,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:29:48,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:29:48,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264448758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:48,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:29:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634417047] [2025-03-08 05:29:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:48,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:48,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:48,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:29:48,270 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:29:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:48,329 INFO L93 Difference]: Finished difference Result 721 states and 1115 transitions. [2025-03-08 05:29:48,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:48,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2025-03-08 05:29:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:48,333 INFO L225 Difference]: With dead ends: 721 [2025-03-08 05:29:48,333 INFO L226 Difference]: Without dead ends: 368 [2025-03-08 05:29:48,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:29:48,337 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:48,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1819 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-08 05:29:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-08 05:29:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 291 states have (on average 1.5429553264604812) internal successors, (449), 294 states have internal predecessors, (449), 57 states have call successors, (57), 17 states have call predecessors, (57), 19 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2025-03-08 05:29:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 569 transitions. [2025-03-08 05:29:48,355 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 569 transitions. Word has length 117 [2025-03-08 05:29:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:48,356 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 569 transitions. [2025-03-08 05:29:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:29:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 569 transitions. [2025-03-08 05:29:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:29:48,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:48,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:48,368 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-08 05:29:48,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:48,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 476488549, now seen corresponding path program 1 times [2025-03-08 05:29:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:48,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134564456] [2025-03-08 05:29:48,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:48,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:29:48,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:29:48,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:48,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:29:48,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134564456] [2025-03-08 05:29:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134564456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:48,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:48,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614381643] [2025-03-08 05:29:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:48,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:48,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:48,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:48,710 INFO L87 Difference]: Start difference. First operand 368 states and 569 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:29:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:48,750 INFO L93 Difference]: Finished difference Result 713 states and 1106 transitions. [2025-03-08 05:29:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2025-03-08 05:29:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:48,753 INFO L225 Difference]: With dead ends: 713 [2025-03-08 05:29:48,753 INFO L226 Difference]: Without dead ends: 368 [2025-03-08 05:29:48,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:48,755 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:48,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1837 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-08 05:29:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-08 05:29:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 291 states have (on average 1.5429553264604812) internal successors, (449), 294 states have internal predecessors, (449), 57 states have call successors, (57), 17 states have call predecessors, (57), 19 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2025-03-08 05:29:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 568 transitions. [2025-03-08 05:29:48,768 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 568 transitions. Word has length 118 [2025-03-08 05:29:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:48,768 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 568 transitions. [2025-03-08 05:29:48,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:29:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 568 transitions. [2025-03-08 05:29:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:29:48,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:48,771 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:48,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:29:48,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:48,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1953740521, now seen corresponding path program 2 times [2025-03-08 05:29:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:48,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016847849] [2025-03-08 05:29:48,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:48,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-08 05:29:48,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 119 statements. [2025-03-08 05:29:48,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:48,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:29:48,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:48,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016847849] [2025-03-08 05:29:48,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016847849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:48,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:48,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:48,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601788082] [2025-03-08 05:29:48,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:48,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:48,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:48,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:48,847 INFO L87 Difference]: Start difference. First operand 368 states and 568 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:29:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:48,866 INFO L93 Difference]: Finished difference Result 368 states and 568 transitions. [2025-03-08 05:29:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 119 [2025-03-08 05:29:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:48,867 INFO L225 Difference]: With dead ends: 368 [2025-03-08 05:29:48,867 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:29:48,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:48,869 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 0 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:48,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1853 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:29:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:29:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:29:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:29:48,870 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2025-03-08 05:29:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:48,870 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:29:48,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 05:29:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:29:48,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:29:48,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:29:48,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:29:48,874 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-03-08 05:29:48,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:29:48,938 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:29:48,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:29:48 BoogieIcfgContainer [2025-03-08 05:29:48,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:29:48,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:29:48,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:29:48,948 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:29:48,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:44" (3/4) ... [2025-03-08 05:29:48,950 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:29:48,954 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailSignKey [2025-03-08 05:29:48,954 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing [2025-03-08 05:29:48,954 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isSigned [2025-03-08 05:29:48,954 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientPrivateKey [2025-03-08 05:29:48,954 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure chuckKeyAdd [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure createClientKeyringEntry [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure generateKeyPair [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientKeyringUser [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sendEmail [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailFrom [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isReadable [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure queue [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientKeyringPublicKey [2025-03-08 05:29:48,955 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientId [2025-03-08 05:29:48,969 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 88 nodes and edges [2025-03-08 05:29:48,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2025-03-08 05:29:48,971 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-08 05:29:48,972 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 05:29:48,973 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:29:48,974 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:29:49,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:29:49,085 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:29:49,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:29:49,086 INFO L158 Benchmark]: Toolchain (without parser) took 5847.99ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 119.7MB in the beginning and 68.3MB in the end (delta: 51.4MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2025-03-08 05:29:49,087 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:29:49,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 589.77ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 81.6MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 05:29:49,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.93ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 75.9MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:29:49,088 INFO L158 Benchmark]: Boogie Preprocessor took 68.04ms. Allocated memory is still 167.8MB. Free memory was 75.9MB in the beginning and 70.9MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:29:49,088 INFO L158 Benchmark]: IcfgBuilder took 928.80ms. Allocated memory is still 167.8MB. Free memory was 70.9MB in the beginning and 77.5MB in the end (delta: -6.6MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2025-03-08 05:29:49,088 INFO L158 Benchmark]: TraceAbstraction took 4044.73ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 76.6MB in the beginning and 85.0MB in the end (delta: -8.4MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2025-03-08 05:29:49,088 INFO L158 Benchmark]: Witness Printer took 137.62ms. Allocated memory is still 201.3MB. Free memory was 85.0MB in the beginning and 68.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:29:49,090 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 589.77ms. Allocated memory is still 167.8MB. Free memory was 119.3MB in the beginning and 81.6MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.93ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 75.9MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.04ms. Allocated memory is still 167.8MB. Free memory was 75.9MB in the beginning and 70.9MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 928.80ms. Allocated memory is still 167.8MB. Free memory was 70.9MB in the beginning and 77.5MB in the end (delta: -6.6MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4044.73ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 76.6MB in the beginning and 85.0MB in the end (delta: -8.4MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Witness Printer took 137.62ms. Allocated memory is still 201.3MB. Free memory was 85.0MB in the beginning and 68.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 48]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] - GenericResultAtLocation [Line: 460]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [460] - GenericResultAtLocation [Line: 689]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [689] - GenericResultAtLocation [Line: 1036]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1036] - GenericResultAtLocation [Line: 1332]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1332] - GenericResultAtLocation [Line: 1341]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1341] - GenericResultAtLocation [Line: 1707]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1707] - GenericResultAtLocation [Line: 1803]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1803] - GenericResultAtLocation [Line: 1822]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1822] - GenericResultAtLocation [Line: 1857]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1857] - GenericResultAtLocation [Line: 2922]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2922] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1337]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 318 locations, 526 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 9194 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6390 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2804 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1149 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4267 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 344/359 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 05:29:49,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE