./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec7_product19.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 7a4e3d1ef75cde0243f57ce4bcedb5827704adb835017a69deaa6c50c3201720 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:25:52,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:25:52,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:25:52,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:25:52,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:25:52,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:25:52,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:25:52,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:25:52,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:25:52,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:25:52,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:25:52,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:25:52,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:25:52,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:25:52,176 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:25:52,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:25:52,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:25:52,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:25:52,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:25:52,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:25:52,178 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 -> 7a4e3d1ef75cde0243f57ce4bcedb5827704adb835017a69deaa6c50c3201720 [2025-03-03 14:25:52,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:25:52,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:25:52,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:25:52,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:25:52,442 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:25:52,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_product19.cil.c [2025-03-03 14:25:53,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b315888e/4eba3652dbe64ce0bf7dfd3c67a1b3f5/FLAG0950bda6e [2025-03-03 14:25:53,962 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:25:53,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product19.cil.c [2025-03-03 14:25:53,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b315888e/4eba3652dbe64ce0bf7dfd3c67a1b3f5/FLAG0950bda6e [2025-03-03 14:25:54,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b315888e/4eba3652dbe64ce0bf7dfd3c67a1b3f5 [2025-03-03 14:25:54,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:25:54,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:25:54,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:25:54,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:25:54,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:25:54,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582180f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54, skipping insertion in model container [2025-03-03 14:25:54,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:25:54,378 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_spec7_product19.cil.c[37206,37219] [2025-03-03 14:25:54,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:25:54,456 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:25:54,462 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [48] [2025-03-03 14:25:54,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [79] [2025-03-03 14:25:54,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [97] [2025-03-03 14:25:54,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [509] [2025-03-03 14:25:54,463 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [547] [2025-03-03 14:25:54,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [913] [2025-03-03 14:25:54,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1138] [2025-03-03 14:25:54,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1236] [2025-03-03 14:25:54,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1533] [2025-03-03 14:25:54,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1815] [2025-03-03 14:25:54,464 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1824] [2025-03-03 14:25:54,532 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_spec7_product19.cil.c[37206,37219] [2025-03-03 14:25:54,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:25:54,583 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:25:54,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54 WrapperNode [2025-03-03 14:25:54,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:25:54,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:25:54,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:25:54,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:25:54,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,655 INFO L138 Inliner]: procedures = 127, calls = 184, calls flagged for inlining = 60, calls inlined = 55, statements flattened = 1000 [2025-03-03 14:25:54,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:25:54,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:25:54,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:25:54,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:25:54,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,684 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:25:54,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:25:54,715 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:25:54,715 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:25:54,715 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:25:54,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (1/1) ... [2025-03-03 14:25:54,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:25:54,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:54,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:25:54,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:25:54,759 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:25:54,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:25:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:25:54,760 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:25:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:25:54,760 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:25:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:25:54,760 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:25:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:25:54,761 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:25:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:25:54,761 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:25:54,761 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:25:54,762 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:25:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:25:54,762 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:25:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:25:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:25:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:25:54,763 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:25:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:25:54,763 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:25:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:25:54,764 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:25:54,764 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:25:54,764 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:25:54,764 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:25:54,764 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:25:54,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:25:54,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:25:54,921 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:25:54,923 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:25:54,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L453: #res := ~retValue_acc~10; [2025-03-03 14:25:55,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2868-1: getClientId_#res#1 := getClientId_~retValue_acc~42#1; [2025-03-03 14:25:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L490-1: isVerified_#res#1 := isVerified_~retValue_acc~11#1; [2025-03-03 14:25:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L153-1: getEmailId_#res#1 := getEmailId_~retValue_acc~2#1; [2025-03-03 14:25:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~41#1; [2025-03-03 14:25:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2433-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~35#1; [2025-03-03 14:25:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~40#1; [2025-03-03 14:25:55,207 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1436-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~24#1; [2025-03-03 14:25:55,213 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: #res := ~retValue_acc~9; [2025-03-03 14:25:55,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: #res := ~retValue_acc~4; [2025-03-03 14:25:55,259 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2525: #res#1 := ~retValue_acc~37#1; [2025-03-03 14:25:55,259 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~36#1; [2025-03-03 14:25:55,284 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233-1: createEmail_#res#1 := createEmail_~retValue_acc~19#1; [2025-03-03 14:25:55,505 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2695-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~39#1; [2025-03-03 14:25:55,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~38#1; [2025-03-03 14:25:55,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1393-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~21#1; [2025-03-03 14:25:55,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1402-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~22#1; [2025-03-03 14:25:55,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~23#1; [2025-03-03 14:25:55,506 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L544-1: valid_product_#res#1 := valid_product_~retValue_acc~13#1; [2025-03-03 14:25:55,511 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: #res := ~retValue_acc~3; [2025-03-03 14:25:55,512 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1209: #res := ~retValue_acc~17; [2025-03-03 14:25:55,600 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-03-03 14:25:55,600 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:25:55,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:25:55,610 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:25:55,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:25:55 BoogieIcfgContainer [2025-03-03 14:25:55,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:25:55,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:25:55,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:25:55,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:25:55,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:25:54" (1/3) ... [2025-03-03 14:25:55,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9d75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:25:55, skipping insertion in model container [2025-03-03 14:25:55,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:25:54" (2/3) ... [2025-03-03 14:25:55,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9d75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:25:55, skipping insertion in model container [2025-03-03 14:25:55,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:25:55" (3/3) ... [2025-03-03 14:25:55,616 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec7_product19.cil.c [2025-03-03 14:25:55,626 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:25:55,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec7_product19.cil.c that has 17 procedures, 300 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:25:55,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:25:55,683 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;@214ebb7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:25:55,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:25:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 300 states, 240 states have (on average 1.5333333333333334) internal successors, (368), 242 states have internal predecessors, (368), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 14:25:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:25:55,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:55,699 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:55,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:55,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash -461670973, now seen corresponding path program 1 times [2025-03-03 14:25:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395221427] [2025-03-03 14:25:55,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:55,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:25:55,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:25:55,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:55,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:25:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395221427] [2025-03-03 14:25:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395221427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:56,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815873172] [2025-03-03 14:25:56,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:56,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:56,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:56,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:56,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:25:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:25:56,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:25:56,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:56,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:56,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:25:56,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:25:56,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:56,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815873172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:56,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:56,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:25:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630577509] [2025-03-03 14:25:56,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:56,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:25:56,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:56,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:25:56,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:56,541 INFO L87 Difference]: Start difference. First operand has 300 states, 240 states have (on average 1.5333333333333334) internal successors, (368), 242 states have internal predecessors, (368), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:25:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:56,578 INFO L93 Difference]: Finished difference Result 447 states and 660 transitions. [2025-03-03 14:25:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:25:56,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 86 [2025-03-03 14:25:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:56,588 INFO L225 Difference]: With dead ends: 447 [2025-03-03 14:25:56,588 INFO L226 Difference]: Without dead ends: 293 [2025-03-03 14:25:56,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:56,592 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:56,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-03 14:25:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-03 14:25:56,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 234 states have (on average 1.5299145299145298) internal successors, (358), 235 states have internal predecessors, (358), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 14:25:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 441 transitions. [2025-03-03 14:25:56,632 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 441 transitions. Word has length 86 [2025-03-03 14:25:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:56,633 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 441 transitions. [2025-03-03 14:25:56,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:25:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 441 transitions. [2025-03-03 14:25:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:25:56,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:56,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:56,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:25:56,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:25:56,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:56,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:56,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1790264736, now seen corresponding path program 1 times [2025-03-03 14:25:56,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:56,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011731534] [2025-03-03 14:25:56,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:56,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:56,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:25:56,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:25:56,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:56,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:25:57,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:57,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011731534] [2025-03-03 14:25:57,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011731534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:57,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046026719] [2025-03-03 14:25:57,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:57,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:57,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:57,065 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:57,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:25:57,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:25:57,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:25:57,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:57,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:57,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:25:57,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:25:57,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046026719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:57,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:25:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951713399] [2025-03-03 14:25:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:57,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:57,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:57,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:57,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:25:57,330 INFO L87 Difference]: Start difference. First operand 293 states and 441 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:25:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:57,372 INFO L93 Difference]: Finished difference Result 436 states and 641 transitions. [2025-03-03 14:25:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:57,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 87 [2025-03-03 14:25:57,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:57,376 INFO L225 Difference]: With dead ends: 436 [2025-03-03 14:25:57,376 INFO L226 Difference]: Without dead ends: 295 [2025-03-03 14:25:57,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:25:57,381 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:57,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 878 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-03 14:25:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-03-03 14:25:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 236 states have (on average 1.5254237288135593) internal successors, (360), 237 states have internal predecessors, (360), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-03 14:25:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 443 transitions. [2025-03-03 14:25:57,399 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 443 transitions. Word has length 87 [2025-03-03 14:25:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:57,400 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 443 transitions. [2025-03-03 14:25:57,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:25:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 443 transitions. [2025-03-03 14:25:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:25:57,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:57,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:57,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:25:57,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:25:57,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:57,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash 886115192, now seen corresponding path program 1 times [2025-03-03 14:25:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:57,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666239078] [2025-03-03 14:25:57,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:57,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:25:57,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:25:57,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:57,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:25:57,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:57,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666239078] [2025-03-03 14:25:57,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666239078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:57,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762924198] [2025-03-03 14:25:57,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:57,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:57,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:57,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:57,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:25:57,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:25:58,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:25:58,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:58,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:58,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:25:58,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:25:58,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762924198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:58,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:25:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767772747] [2025-03-03 14:25:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:58,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:58,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:58,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:25:58,058 INFO L87 Difference]: Start difference. First operand 295 states and 443 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:25:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:58,089 INFO L93 Difference]: Finished difference Result 619 states and 944 transitions. [2025-03-03 14:25:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2025-03-03 14:25:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:58,093 INFO L225 Difference]: With dead ends: 619 [2025-03-03 14:25:58,093 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 14:25:58,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:25:58,095 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 107 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:58,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 852 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 14:25:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2025-03-03 14:25:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 273 states have (on average 1.5421245421245422) internal successors, (421), 274 states have internal predecessors, (421), 53 states have call successors, (53), 16 states have call predecessors, (53), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:25:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2025-03-03 14:25:58,112 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 92 [2025-03-03 14:25:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:58,112 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 526 transitions. [2025-03-03 14:25:58,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:25:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 526 transitions. [2025-03-03 14:25:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:25:58,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:58,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:58,122 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-03 14:25:58,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:58,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:58,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash 423142171, now seen corresponding path program 1 times [2025-03-03 14:25:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013469353] [2025-03-03 14:25:58,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:58,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:25:58,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:25:58,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:58,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:25:58,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:58,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013469353] [2025-03-03 14:25:58,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013469353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:58,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280329364] [2025-03-03 14:25:58,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:58,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:58,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:58,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:58,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:25:58,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:25:58,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:25:58,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:58,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:58,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:25:58,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:25:58,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280329364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:25:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616023575] [2025-03-03 14:25:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:58,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:58,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:58,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:25:58,706 INFO L87 Difference]: Start difference. First operand 343 states and 526 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:25:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:58,759 INFO L93 Difference]: Finished difference Result 677 states and 1042 transitions. [2025-03-03 14:25:58,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:58,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2025-03-03 14:25:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:58,762 INFO L225 Difference]: With dead ends: 677 [2025-03-03 14:25:58,762 INFO L226 Difference]: Without dead ends: 345 [2025-03-03 14:25:58,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:25:58,764 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 2 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:58,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1721 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-03 14:25:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-03 14:25:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 274 states have (on average 1.5401459854014599) internal successors, (422), 276 states have internal predecessors, (422), 53 states have call successors, (53), 16 states have call predecessors, (53), 17 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2025-03-03 14:25:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 529 transitions. [2025-03-03 14:25:58,779 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 529 transitions. Word has length 93 [2025-03-03 14:25:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:58,780 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 529 transitions. [2025-03-03 14:25:58,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:25:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 529 transitions. [2025-03-03 14:25:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:25:58,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:58,781 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:58,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:25:58,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:58,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:58,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 422762774, now seen corresponding path program 1 times [2025-03-03 14:25:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180198132] [2025-03-03 14:25:58,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:58,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:25:59,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:25:59,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:59,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:25:59,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180198132] [2025-03-03 14:25:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180198132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94900314] [2025-03-03 14:25:59,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:59,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:59,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:59,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:59,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:25:59,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:25:59,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:25:59,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:59,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:59,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:25:59,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:25:59,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:59,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94900314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:59,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:59,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:25:59,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072696263] [2025-03-03 14:25:59,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:59,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:59,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:59,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:59,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:25:59,334 INFO L87 Difference]: Start difference. First operand 345 states and 529 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:25:59,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:59,392 INFO L93 Difference]: Finished difference Result 679 states and 1047 transitions. [2025-03-03 14:25:59,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:59,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2025-03-03 14:25:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:59,394 INFO L225 Difference]: With dead ends: 679 [2025-03-03 14:25:59,394 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 14:25:59,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:25:59,397 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 2 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:59,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1707 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 14:25:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-03-03 14:25:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 275 states have (on average 1.538181818181818) internal successors, (423), 278 states have internal predecessors, (423), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2025-03-03 14:25:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 535 transitions. [2025-03-03 14:25:59,414 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 535 transitions. Word has length 94 [2025-03-03 14:25:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:59,416 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 535 transitions. [2025-03-03 14:25:59,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:25:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 535 transitions. [2025-03-03 14:25:59,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 14:25:59,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:59,418 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:59,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:25:59,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:59,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1688290941, now seen corresponding path program 1 times [2025-03-03 14:25:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775378833] [2025-03-03 14:25:59,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:59,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 14:25:59,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 14:25:59,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:59,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:25:59,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:59,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775378833] [2025-03-03 14:25:59,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775378833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:59,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:59,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:25:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040449544] [2025-03-03 14:25:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:59,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:25:59,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:59,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:25:59,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:59,729 INFO L87 Difference]: Start difference. First operand 347 states and 535 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:25:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:59,765 INFO L93 Difference]: Finished difference Result 671 states and 1038 transitions. [2025-03-03 14:25:59,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:25:59,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 95 [2025-03-03 14:25:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:59,771 INFO L225 Difference]: With dead ends: 671 [2025-03-03 14:25:59,771 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 14:25:59,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:25:59,772 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 2 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:59,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1725 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 14:25:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-03-03 14:25:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 275 states have (on average 1.538181818181818) internal successors, (423), 278 states have internal predecessors, (423), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2025-03-03 14:25:59,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 534 transitions. [2025-03-03 14:25:59,787 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 534 transitions. Word has length 95 [2025-03-03 14:25:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:59,788 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 534 transitions. [2025-03-03 14:25:59,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:25:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 534 transitions. [2025-03-03 14:25:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:25:59,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:59,791 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:59,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:25:59,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:59,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:59,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1928221018, now seen corresponding path program 2 times [2025-03-03 14:25:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:59,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270686276] [2025-03-03 14:25:59,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:25:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:59,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-03 14:25:59,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 96 statements. [2025-03-03 14:25:59,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:25:59,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:25:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270686276] [2025-03-03 14:25:59,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270686276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:59,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:59,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:25:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336909005] [2025-03-03 14:25:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:59,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:25:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:59,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:25:59,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:25:59,880 INFO L87 Difference]: Start difference. First operand 347 states and 534 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:25:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:59,912 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2025-03-03 14:25:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:25:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-03 14:25:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:59,914 INFO L225 Difference]: With dead ends: 347 [2025-03-03 14:25:59,914 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:25:59,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:25:59,915 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 0 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:59,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2601 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:25:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:25:59,917 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-03 14:25:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:25:59,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2025-03-03 14:25:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:59,917 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:25:59,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:25:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:25:59,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:25:59,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:25:59,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:25:59,922 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-03-03 14:25:59,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:25:59,987 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:25:59,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:25:59 BoogieIcfgContainer [2025-03-03 14:25:59,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:26:00,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:26:00,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:26:00,000 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:26:00,000 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:25:55" (3/4) ... [2025-03-03 14:26:00,002 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:26:00,006 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailSignKey [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isSigned [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientPrivateKey [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure chuckKeyAdd [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure createClientKeyringEntry [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure generateKeyPair [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientKeyringUser [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sendEmail [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailFrom [2025-03-03 14:26:00,007 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isReadable [2025-03-03 14:26:00,008 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientKeyringPublicKey [2025-03-03 14:26:00,008 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientId [2025-03-03 14:26:00,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 84 nodes and edges [2025-03-03 14:26:00,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 43 nodes and edges [2025-03-03 14:26:00,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-03 14:26:00,030 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 14:26:00,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:26:00,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:26:00,142 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:26:00,142 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:26:00,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:26:00,143 INFO L158 Benchmark]: Toolchain (without parser) took 6137.21ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 101.9MB in the beginning and 130.3MB in the end (delta: -28.4MB). Peak memory consumption was 135.3MB. Max. memory is 16.1GB. [2025-03-03 14:26:00,143 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:26:00,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.83ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 64.3MB in the end (delta: 37.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 14:26:00,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.52ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 59.3MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:26:00,144 INFO L158 Benchmark]: Boogie Preprocessor took 58.67ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 54.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:26:00,144 INFO L158 Benchmark]: IcfgBuilder took 894.70ms. Allocated memory is still 142.6MB. Free memory was 53.9MB in the beginning and 49.2MB in the end (delta: 4.7MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2025-03-03 14:26:00,144 INFO L158 Benchmark]: TraceAbstraction took 4387.51ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 48.5MB in the beginning and 147.1MB in the end (delta: -98.6MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2025-03-03 14:26:00,145 INFO L158 Benchmark]: Witness Printer took 142.98ms. Allocated memory is still 302.0MB. Free memory was 147.1MB in the beginning and 130.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:26:00,147 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.17ms. Allocated memory is still 201.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 576.83ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 64.3MB in the end (delta: 37.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.52ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 59.3MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.67ms. Allocated memory is still 142.6MB. Free memory was 59.3MB in the beginning and 54.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 894.70ms. Allocated memory is still 142.6MB. Free memory was 53.9MB in the beginning and 49.2MB in the end (delta: 4.7MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4387.51ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 48.5MB in the beginning and 147.1MB in the end (delta: -98.6MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. * Witness Printer took 142.98ms. Allocated memory is still 302.0MB. Free memory was 147.1MB in the beginning and 130.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,"EncryptVerify_spec.i","") [48] - GenericResultAtLocation [Line: 79]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [79] - GenericResultAtLocation [Line: 97]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [97] - GenericResultAtLocation [Line: 509]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [509] - GenericResultAtLocation [Line: 547]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [547] - GenericResultAtLocation [Line: 913]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [913] - GenericResultAtLocation [Line: 1138]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1138] - GenericResultAtLocation [Line: 1236]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1236] - GenericResultAtLocation [Line: 1533]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1533] - GenericResultAtLocation [Line: 1815]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1815] - GenericResultAtLocation [Line: 1824]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1824] * 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: 1820]: 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 17 procedures, 300 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 9933 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6854 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3079 mSDtfsCounter, 152 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=5, InterpolantAutomatonStates: 30, 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, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1043 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1083 ConstructedInterpolants, 0 QuantifiedInterpolants, 1192 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4706 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 335/353 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-03 14:26:00,163 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