./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product09.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 3b43506942a12950209750f07d771d1d388e9661c8c19f0364d898e10e246352 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:29:08,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:29:08,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:29:08,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:29:08,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:29:08,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:29:08,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:29:08,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:29:08,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:29:08,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:29:08,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:29:08,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:29:08,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:29:08,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:29:08,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:29:08,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:29:08,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:08,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:29:08,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:29:08,618 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 -> 3b43506942a12950209750f07d771d1d388e9661c8c19f0364d898e10e246352 [2025-03-08 05:29:08,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:29:08,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:29:08,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:29:08,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:29:08,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:29:08,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product09.cil.c [2025-03-08 05:29:09,914 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de252b9a/e7e5a6d16b504714930345b1de660b0f/FLAG6353468a1 [2025-03-08 05:29:10,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:29:10,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product09.cil.c [2025-03-08 05:29:10,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de252b9a/e7e5a6d16b504714930345b1de660b0f/FLAG6353468a1 [2025-03-08 05:29:10,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de252b9a/e7e5a6d16b504714930345b1de660b0f [2025-03-08 05:29:10,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:29:10,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:29:10,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:10,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:29:10,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:29:10,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2029f000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10, skipping insertion in model container [2025-03-08 05:29:10,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:29:10,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product09.cil.c[57372,57385] [2025-03-08 05:29:10,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:10,648 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:29:10,655 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-08 05:29:10,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [246] [2025-03-08 05:29:10,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [295] [2025-03-08 05:29:10,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [448] [2025-03-08 05:29:10,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [860] [2025-03-08 05:29:10,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1226] [2025-03-08 05:29:10,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2301] [2025-03-08 05:29:10,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2503] [2025-03-08 05:29:10,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2567] [2025-03-08 05:29:10,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2584] [2025-03-08 05:29:10,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2593] [2025-03-08 05:29:10,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product09.cil.c[57372,57385] [2025-03-08 05:29:10,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:10,751 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:29:10,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10 WrapperNode [2025-03-08 05:29:10,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:10,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:10,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:29:10,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:29:10,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,795 INFO L138 Inliner]: procedures = 110, calls = 128, calls flagged for inlining = 38, calls inlined = 33, statements flattened = 658 [2025-03-08 05:29:10,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:10,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:29:10,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:29:10,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:29:10,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,821 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-03-08 05:29:10,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:29:10,841 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:29:10,841 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:29:10,841 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:29:10,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (1/1) ... [2025-03-08 05:29:10,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:10,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:10,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:29:10,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:29:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Base [2025-03-08 05:29:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Base [2025-03-08 05:29:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:29:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:29:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:29:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:29:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:29:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:29:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:29:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:29:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:29:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:29:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:29:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:29:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:29:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:29:10,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:29:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:29:10,890 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:29:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:29:10,890 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:29:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:29:10,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:29:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:29:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:29:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:29:10,890 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:29:10,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:29:10,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:29:11,029 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:29:11,031 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:29:11,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2025-03-08 05:29:11,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L541-1: getEmailFrom_#res#1 := getEmailFrom_~retValue_acc~5#1; [2025-03-08 05:29:11,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L504-1: getEmailId_#res#1 := getEmailId_~retValue_acc~4#1; [2025-03-08 05:29:11,191 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2231-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~32#1; [2025-03-08 05:29:11,226 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: #res := ~retValue_acc~6; [2025-03-08 05:29:11,242 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2564-1: createEmail_#res#1 := createEmail_~retValue_acc~40#1; [2025-03-08 05:29:11,252 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1387: #res := ~retValue_acc~20; [2025-03-08 05:29:11,274 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1713: #res := ~retValue_acc~24; [2025-03-08 05:29:11,462 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L292-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:29:11,463 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2025-03-08 05:29:11,463 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2025-03-08 05:29:11,463 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2025-03-08 05:29:11,486 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2540: #res := ~retValue_acc~38; [2025-03-08 05:29:11,532 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2025-03-08 05:29:11,532 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:29:11,545 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:29:11,545 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:29:11,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:11 BoogieIcfgContainer [2025-03-08 05:29:11,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:29:11,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:29:11,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:29:11,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:29:11,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:10" (1/3) ... [2025-03-08 05:29:11,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544aabff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:11, skipping insertion in model container [2025-03-08 05:29:11,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:10" (2/3) ... [2025-03-08 05:29:11,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544aabff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:11, skipping insertion in model container [2025-03-08 05:29:11,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:11" (3/3) ... [2025-03-08 05:29:11,554 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product09.cil.c [2025-03-08 05:29:11,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:29:11,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product09.cil.c that has 13 procedures, 207 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:29:11,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:29:11,628 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;@60f7e76b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:29:11,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:29:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 167 states have (on average 1.562874251497006) internal successors, (261), 170 states have internal predecessors, (261), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 05:29:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:29:11,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:11,639 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:29:11,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:11,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:11,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1417246475, now seen corresponding path program 1 times [2025-03-08 05:29:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:11,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510507523] [2025-03-08 05:29:11,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:11,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:29:11,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:29:11,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:11,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:29:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:12,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510507523] [2025-03-08 05:29:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510507523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897561580] [2025-03-08 05:29:12,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:12,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:12,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:29:12,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:29:12,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:29:12,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:12,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:12,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 05:29:12,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:29:12,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:12,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897561580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:12,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:12,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-08 05:29:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091989645] [2025-03-08 05:29:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:29:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:12,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:29:12,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:12,370 INFO L87 Difference]: Start difference. First operand has 207 states, 167 states have (on average 1.562874251497006) internal successors, (261), 170 states have internal predecessors, (261), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:29:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:12,395 INFO L93 Difference]: Finished difference Result 327 states and 484 transitions. [2025-03-08 05:29:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:29:12,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2025-03-08 05:29:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:12,402 INFO L225 Difference]: With dead ends: 327 [2025-03-08 05:29:12,402 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 05:29:12,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:12,411 INFO L435 NwaCegarLoop]: 310 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, 310 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-08 05:29:12,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 05:29:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-08 05:29:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 161 states have (on average 1.5590062111801242) internal successors, (251), 163 states have internal predecessors, (251), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 05:29:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 302 transitions. [2025-03-08 05:29:12,456 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 302 transitions. Word has length 84 [2025-03-08 05:29:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:12,457 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 302 transitions. [2025-03-08 05:29:12,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:29:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 302 transitions. [2025-03-08 05:29:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:29:12,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:12,460 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:29:12,468 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-08 05:29:12,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:29:12,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:12,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash 856546697, now seen corresponding path program 1 times [2025-03-08 05:29:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802643229] [2025-03-08 05:29:12,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:12,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:29:12,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:29:12,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:12,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:29:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802643229] [2025-03-08 05:29:12,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802643229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:12,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53705713] [2025-03-08 05:29:12,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:12,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:12,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:12,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:12,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:29:12,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:29:13,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:29:13,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:13,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:29:13,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:29:13,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:13,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53705713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:13,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:13,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:13,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410680916] [2025-03-08 05:29:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:13,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:13,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:13,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:13,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:13,097 INFO L87 Difference]: Start difference. First operand 200 states and 302 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:29:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:13,124 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2025-03-08 05:29:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:13,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2025-03-08 05:29:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:13,126 INFO L225 Difference]: With dead ends: 315 [2025-03-08 05:29:13,126 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 05:29:13,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:13,127 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 600 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-08 05:29:13,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 600 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 05:29:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-08 05:29:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.5555555555555556) internal successors, (252), 164 states have internal predecessors, (252), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-08 05:29:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 303 transitions. [2025-03-08 05:29:13,145 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 303 transitions. Word has length 84 [2025-03-08 05:29:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:13,145 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 303 transitions. [2025-03-08 05:29:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:29:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 303 transitions. [2025-03-08 05:29:13,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:29:13,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:13,150 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:29:13,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:29:13,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:29:13,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:13,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash -812285857, now seen corresponding path program 1 times [2025-03-08 05:29:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226449644] [2025-03-08 05:29:13,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:13,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:29:13,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:29:13,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:13,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:29:13,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:13,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226449644] [2025-03-08 05:29:13,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226449644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:13,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093439119] [2025-03-08 05:29:13,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:13,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:13,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:13,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:13,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:29:13,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:29:13,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:29:13,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:13,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:13,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:29:13,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:29:13,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:13,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093439119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:13,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:13,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:29:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324900207] [2025-03-08 05:29:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:13,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:13,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:13,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:13,757 INFO L87 Difference]: Start difference. First operand 201 states and 303 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:29:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:13,808 INFO L93 Difference]: Finished difference Result 395 states and 599 transitions. [2025-03-08 05:29:13,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:13,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-08 05:29:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:13,810 INFO L225 Difference]: With dead ends: 395 [2025-03-08 05:29:13,812 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 05:29:13,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:13,814 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 2 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:13,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1165 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 05:29:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-08 05:29:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 163 states have (on average 1.5521472392638036) internal successors, (253), 166 states have internal predecessors, (253), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (27), 24 states have call predecessors, (27), 25 states have call successors, (27) [2025-03-08 05:29:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 306 transitions. [2025-03-08 05:29:13,833 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 306 transitions. Word has length 87 [2025-03-08 05:29:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:13,833 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 306 transitions. [2025-03-08 05:29:13,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:29:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 306 transitions. [2025-03-08 05:29:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:29:13,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:13,839 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 05:29:13,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:14,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:14,040 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash 724777439, now seen corresponding path program 1 times [2025-03-08 05:29:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298381449] [2025-03-08 05:29:14,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:14,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:29:14,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:29:14,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:14,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:29:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298381449] [2025-03-08 05:29:14,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298381449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:14,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:14,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123043850] [2025-03-08 05:29:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:14,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:14,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:14,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:14,140 INFO L87 Difference]: Start difference. First operand 203 states and 306 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:29:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:14,171 INFO L93 Difference]: Finished difference Result 387 states and 587 transitions. [2025-03-08 05:29:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2025-03-08 05:29:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:14,173 INFO L225 Difference]: With dead ends: 387 [2025-03-08 05:29:14,173 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 05:29:14,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:14,174 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 2 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:14,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1169 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 05:29:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-08 05:29:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 163 states have (on average 1.5521472392638036) internal successors, (253), 166 states have internal predecessors, (253), 26 states have call successors, (26), 12 states have call predecessors, (26), 13 states have return successors, (26), 24 states have call predecessors, (26), 25 states have call successors, (26) [2025-03-08 05:29:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 305 transitions. [2025-03-08 05:29:14,187 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 305 transitions. Word has length 88 [2025-03-08 05:29:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:14,187 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 305 transitions. [2025-03-08 05:29:14,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:29:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 305 transitions. [2025-03-08 05:29:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 05:29:14,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:14,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:14,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:29:14,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:14,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:14,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1484333371, now seen corresponding path program 2 times [2025-03-08 05:29:14,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336147143] [2025-03-08 05:29:14,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:14,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:14,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-08 05:29:14,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 89 statements. [2025-03-08 05:29:14,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:14,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:29:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336147143] [2025-03-08 05:29:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336147143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:14,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048564484] [2025-03-08 05:29:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:14,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:14,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:14,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:14,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:14,284 INFO L87 Difference]: Start difference. First operand 203 states and 305 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:29:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:14,351 INFO L93 Difference]: Finished difference Result 494 states and 744 transitions. [2025-03-08 05:29:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:14,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-03-08 05:29:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:14,354 INFO L225 Difference]: With dead ends: 494 [2025-03-08 05:29:14,355 INFO L226 Difference]: Without dead ends: 388 [2025-03-08 05:29:14,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:14,357 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 264 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:14,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1172 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-08 05:29:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2025-03-08 05:29:14,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 312 states have (on average 1.5673076923076923) internal successors, (489), 317 states have internal predecessors, (489), 49 states have call successors, (49), 23 states have call predecessors, (49), 24 states have return successors, (48), 45 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-08 05:29:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 586 transitions. [2025-03-08 05:29:14,384 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 586 transitions. Word has length 89 [2025-03-08 05:29:14,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:14,385 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 586 transitions. [2025-03-08 05:29:14,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:29:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 586 transitions. [2025-03-08 05:29:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:29:14,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:14,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:14,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:29:14,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:14,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash -92394073, now seen corresponding path program 1 times [2025-03-08 05:29:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:14,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245909557] [2025-03-08 05:29:14,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:14,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:14,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:29:14,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:29:14,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:14,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 05:29:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:14,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245909557] [2025-03-08 05:29:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245909557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:14,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:14,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:14,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163599615] [2025-03-08 05:29:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:14,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:14,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:14,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:14,487 INFO L87 Difference]: Start difference. First operand 386 states and 586 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:29:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:14,525 INFO L93 Difference]: Finished difference Result 755 states and 1152 transitions. [2025-03-08 05:29:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 90 [2025-03-08 05:29:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:14,529 INFO L225 Difference]: With dead ends: 755 [2025-03-08 05:29:14,529 INFO L226 Difference]: Without dead ends: 388 [2025-03-08 05:29:14,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:14,531 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:14,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1172 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:14,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-08 05:29:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-03-08 05:29:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 313 states have (on average 1.5654952076677315) internal successors, (490), 319 states have internal predecessors, (490), 49 states have call successors, (49), 23 states have call predecessors, (49), 25 states have return successors, (50), 45 states have call predecessors, (50), 47 states have call successors, (50) [2025-03-08 05:29:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 589 transitions. [2025-03-08 05:29:14,556 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 589 transitions. Word has length 90 [2025-03-08 05:29:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:14,556 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 589 transitions. [2025-03-08 05:29:14,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:29:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 589 transitions. [2025-03-08 05:29:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 05:29:14,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:14,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:14,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:29:14,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:14,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1481471136, now seen corresponding path program 1 times [2025-03-08 05:29:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626188486] [2025-03-08 05:29:14,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:14,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:14,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:29:14,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:29:14,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:14,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:14,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:14,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626188486] [2025-03-08 05:29:14,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626188486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:14,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039928410] [2025-03-08 05:29:14,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:14,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:14,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:14,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:14,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:29:14,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:29:14,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:29:14,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:14,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:14,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:14,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:14,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:29:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039928410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:29:14,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:29:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:29:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768085970] [2025-03-08 05:29:14,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:29:14,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:29:14,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:14,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:29:14,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:14,953 INFO L87 Difference]: Start difference. First operand 388 states and 589 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:29:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:15,030 INFO L93 Difference]: Finished difference Result 891 states and 1390 transitions. [2025-03-08 05:29:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:15,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 91 [2025-03-08 05:29:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:15,037 INFO L225 Difference]: With dead ends: 891 [2025-03-08 05:29:15,037 INFO L226 Difference]: Without dead ends: 661 [2025-03-08 05:29:15,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:15,038 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 334 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:15,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1607 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-08 05:29:15,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 621. [2025-03-08 05:29:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 531 states have (on average 1.6817325800376648) internal successors, (893), 537 states have internal predecessors, (893), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (65), 60 states have call predecessors, (65), 62 states have call successors, (65) [2025-03-08 05:29:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1022 transitions. [2025-03-08 05:29:15,070 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1022 transitions. Word has length 91 [2025-03-08 05:29:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:15,070 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 1022 transitions. [2025-03-08 05:29:15,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:29:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1022 transitions. [2025-03-08 05:29:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:29:15,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:15,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:15,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:15,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:15,274 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:15,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:15,274 INFO L85 PathProgramCache]: Analyzing trace with hash -780158740, now seen corresponding path program 1 times [2025-03-08 05:29:15,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:15,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56423501] [2025-03-08 05:29:15,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:15,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:29:15,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:29:15,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:15,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:29:15,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56423501] [2025-03-08 05:29:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56423501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:15,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:15,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:15,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949623005] [2025-03-08 05:29:15,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:15,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:15,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:15,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:15,337 INFO L87 Difference]: Start difference. First operand 621 states and 1022 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:29:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:15,363 INFO L93 Difference]: Finished difference Result 1461 states and 2454 transitions. [2025-03-08 05:29:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:15,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2025-03-08 05:29:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:15,370 INFO L225 Difference]: With dead ends: 1461 [2025-03-08 05:29:15,370 INFO L226 Difference]: Without dead ends: 866 [2025-03-08 05:29:15,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:15,373 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 84 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:15,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 610 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-08 05:29:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 850. [2025-03-08 05:29:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 745 states have (on average 1.7208053691275167) internal successors, (1282), 751 states have internal predecessors, (1282), 79 states have call successors, (79), 23 states have call predecessors, (79), 25 states have return successors, (80), 75 states have call predecessors, (80), 77 states have call successors, (80) [2025-03-08 05:29:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1441 transitions. [2025-03-08 05:29:15,414 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1441 transitions. Word has length 99 [2025-03-08 05:29:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:15,414 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1441 transitions. [2025-03-08 05:29:15,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:29:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1441 transitions. [2025-03-08 05:29:15,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:29:15,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:15,418 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2025-03-08 05:29:15,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:29:15,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1657039580, now seen corresponding path program 2 times [2025-03-08 05:29:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635672545] [2025-03-08 05:29:15,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:15,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-08 05:29:15,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 100 statements. [2025-03-08 05:29:15,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:15,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:29:15,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635672545] [2025-03-08 05:29:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635672545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:15,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:15,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:29:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465104081] [2025-03-08 05:29:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:15,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:29:15,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:15,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:29:15,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:15,532 INFO L87 Difference]: Start difference. First operand 850 states and 1441 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, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 05:29:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:15,573 INFO L93 Difference]: Finished difference Result 850 states and 1441 transitions. [2025-03-08 05:29:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:15,574 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, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 100 [2025-03-08 05:29:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:15,574 INFO L225 Difference]: With dead ends: 850 [2025-03-08 05:29:15,574 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:29:15,576 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-08 05:29:15,576 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1767 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-08 05:29:15,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1767 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:29:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:29:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:29:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:29:15,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2025-03-08 05:29:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:15,577 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:29:15,577 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, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 05:29:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:29:15,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:29:15,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:29:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:29:15,581 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-08 05:29:15,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:29:15,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:29:15,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:29:15 BoogieIcfgContainer [2025-03-08 05:29:15,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:29:15,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:29:15,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:29:15,672 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:29:15,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:11" (3/4) ... [2025-03-08 05:29:15,673 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:29:15,683 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing__wrappee__Base [2025-03-08 05:29:15,683 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing [2025-03-08 05:29:15,683 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2025-03-08 05:29:15,683 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2025-03-08 05:29:15,683 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookSize [2025-03-08 05:29:15,683 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sendEmail [2025-03-08 05:29:15,683 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getClientAddressBookSize [2025-03-08 05:29:15,684 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getClientAddressBookAddress [2025-03-08 05:29:15,684 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2025-03-08 05:29:15,684 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookAddress [2025-03-08 05:29:15,684 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isReadable [2025-03-08 05:29:15,684 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientId [2025-03-08 05:29:15,692 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2025-03-08 05:29:15,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-08 05:29:15,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 05:29:15,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 05:29:15,695 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:29:15,696 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:29:15,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:29:15,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:29:15,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:29:15,793 INFO L158 Benchmark]: Toolchain (without parser) took 5545.24ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 103.0MB in the beginning and 265.1MB in the end (delta: -162.1MB). Peak memory consumption was 183.6MB. Max. memory is 16.1GB. [2025-03-08 05:29:15,793 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:29:15,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.94ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 67.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 05:29:15,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.74ms. Allocated memory is still 142.6MB. Free memory was 67.6MB in the beginning and 63.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:29:15,793 INFO L158 Benchmark]: Boogie Preprocessor took 42.35ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 60.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:29:15,793 INFO L158 Benchmark]: IcfgBuilder took 704.50ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 77.3MB in the end (delta: -17.3MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2025-03-08 05:29:15,793 INFO L158 Benchmark]: TraceAbstraction took 4124.15ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 76.4MB in the beginning and 103.1MB in the end (delta: -26.7MB). Peak memory consumption was 142.8MB. Max. memory is 16.1GB. [2025-03-08 05:29:15,794 INFO L158 Benchmark]: Witness Printer took 120.57ms. Allocated memory is still 318.8MB. Free memory was 103.1MB in the beginning and 265.1MB in the end (delta: -162.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:29:15,795 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 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.94ms. Allocated memory is still 142.6MB. Free memory was 102.1MB in the beginning and 67.6MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.74ms. Allocated memory is still 142.6MB. Free memory was 67.6MB in the beginning and 63.8MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.35ms. Allocated memory is still 142.6MB. Free memory was 63.8MB in the beginning and 60.0MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 704.50ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 77.3MB in the end (delta: -17.3MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4124.15ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 76.4MB in the beginning and 103.1MB in the end (delta: -26.7MB). Peak memory consumption was 142.8MB. Max. memory is 16.1GB. * Witness Printer took 120.57ms. Allocated memory is still 318.8MB. Free memory was 103.1MB in the beginning and 265.1MB in the end (delta: -162.0MB). Peak memory consumption was 8.4MB. 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,"scenario.i","") [48] - GenericResultAtLocation [Line: 246]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [246] - GenericResultAtLocation [Line: 295]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [295] - GenericResultAtLocation [Line: 448]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [448] - GenericResultAtLocation [Line: 860]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [860] - GenericResultAtLocation [Line: 1226]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1226] - GenericResultAtLocation [Line: 2301]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2301] - GenericResultAtLocation [Line: 2503]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2503] - GenericResultAtLocation [Line: 2567]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2567] - GenericResultAtLocation [Line: 2584]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2584] - GenericResultAtLocation [Line: 2593]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2593] * 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: 2589]: 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 13 procedures, 207 locations, 339 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 687 mSDsluCounter, 9572 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6867 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 2705 mSDtfsCounter, 185 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=850occurred in iteration=8, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 58 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1235 ConstructedInterpolants, 0 QuantifiedInterpolants, 1411 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3348 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 305/317 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 05:29:15,807 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