./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_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-?-798a7b3-m [2025-03-03 14:19:20,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:19:20,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:19:20,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:19:20,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:19:20,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:19:20,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:19:20,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:19:20,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:19:20,239 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:19:20,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:19:20,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:19:20,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:19:20,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:19:20,240 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:19:20,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:19:20,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:19:20,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:19:20,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:19:20,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:19:20,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:19:20,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:19:20,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:19:20,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:19:20,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:19:20,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:19:20,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:19:20,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:19:20,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:19:20,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:19:20,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:19:20,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:19:20,243 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-03 14:19:20,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:19:20,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:19:20,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:19:20,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:19:20,454 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:19:20,456 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-03 14:19:21,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f9b15b7/9676136f560745fcb8463df23ac05c85/FLAG965f6b062 [2025-03-03 14:19:21,893 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:19:21,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product09.cil.c [2025-03-03 14:19:21,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f9b15b7/9676136f560745fcb8463df23ac05c85/FLAG965f6b062 [2025-03-03 14:19:21,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60f9b15b7/9676136f560745fcb8463df23ac05c85 [2025-03-03 14:19:21,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:19:21,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:19:21,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:19:21,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:19:21,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:19:21,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:19:21" (1/1) ... [2025-03-03 14:19:21,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f94c4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:21, skipping insertion in model container [2025-03-03 14:19:21,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:19:21" (1/1) ... [2025-03-03 14:19:21,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:19:22,283 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-03 14:19:22,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:19:22,299 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:19:22,305 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-03 14:19:22,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [246] [2025-03-03 14:19:22,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [295] [2025-03-03 14:19:22,307 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [448] [2025-03-03 14:19:22,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [860] [2025-03-03 14:19:22,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1226] [2025-03-03 14:19:22,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2301] [2025-03-03 14:19:22,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2503] [2025-03-03 14:19:22,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2567] [2025-03-03 14:19:22,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2584] [2025-03-03 14:19:22,308 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2593] [2025-03-03 14:19:22,397 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-03 14:19:22,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:19:22,424 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:19:22,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22 WrapperNode [2025-03-03 14:19:22,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:19:22,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:19:22,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:19:22,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:19:22,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,482 INFO L138 Inliner]: procedures = 110, calls = 128, calls flagged for inlining = 38, calls inlined = 33, statements flattened = 658 [2025-03-03 14:19:22,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:19:22,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:19:22,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:19:22,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:19:22,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,519 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-03 14:19:22,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:19:22,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:19:22,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:19:22,551 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:19:22,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (1/1) ... [2025-03-03 14:19:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:19:22,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:22,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:19:22,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:19:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Base [2025-03-03 14:19:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Base [2025-03-03 14:19:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:19:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:19:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:19:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:19:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:19:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:19:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:19:22,609 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:19:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:19:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:19:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:19:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:19:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:19:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:19:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:19:22,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:19:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:19:22,740 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:19:22,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:19:22,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2025-03-03 14:19:22,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L541-1: getEmailFrom_#res#1 := getEmailFrom_~retValue_acc~5#1; [2025-03-03 14:19:22,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L504-1: getEmailId_#res#1 := getEmailId_~retValue_acc~4#1; [2025-03-03 14:19:22,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2231-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~32#1; [2025-03-03 14:19:22,940 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: #res := ~retValue_acc~6; [2025-03-03 14:19:22,963 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2564-1: createEmail_#res#1 := createEmail_~retValue_acc~40#1; [2025-03-03 14:19:22,972 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1387: #res := ~retValue_acc~20; [2025-03-03 14:19:23,009 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1713: #res := ~retValue_acc~24; [2025-03-03 14:19:23,220 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L292-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-03 14:19:23,220 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2025-03-03 14:19:23,220 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2025-03-03 14:19:23,220 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2025-03-03 14:19:23,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2540: #res := ~retValue_acc~38; [2025-03-03 14:19:23,314 INFO L? ?]: Removed 279 outVars from TransFormulas that were not future-live. [2025-03-03 14:19:23,315 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:19:23,325 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:19:23,325 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:19:23,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:23 BoogieIcfgContainer [2025-03-03 14:19:23,326 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:19:23,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:19:23,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:19:23,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:19:23,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:19:21" (1/3) ... [2025-03-03 14:19:23,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664069be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:19:23, skipping insertion in model container [2025-03-03 14:19:23,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:19:22" (2/3) ... [2025-03-03 14:19:23,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@664069be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:19:23, skipping insertion in model container [2025-03-03 14:19:23,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:23" (3/3) ... [2025-03-03 14:19:23,336 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product09.cil.c [2025-03-03 14:19:23,346 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:19:23,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product09.cil.c that has 13 procedures, 208 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:19:23,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:19:23,416 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;@1fad3a46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:19:23,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:19:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 171 states have internal predecessors, (262), 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-03 14:19:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 14:19:23,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:23,431 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-03 14:19:23,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -531948788, now seen corresponding path program 1 times [2025-03-03 14:19:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:23,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386085920] [2025-03-03 14:19:23,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:23,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:19:23,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:19:23,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:23,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:23,892 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-03 14:19:23,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:23,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386085920] [2025-03-03 14:19:23,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386085920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:23,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783972134] [2025-03-03 14:19:23,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:23,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:23,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:23,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:23,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:19:24,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:19:24,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:19:24,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:24,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:24,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:19:24,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:24,150 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-03 14:19:24,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:24,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783972134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:24,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:24,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:19:24,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541240048] [2025-03-03 14:19:24,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:24,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:19:24,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:24,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:19:24,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:24,169 INFO L87 Difference]: Start difference. First operand has 208 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 171 states have internal predecessors, (262), 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-03 14:19:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:24,208 INFO L93 Difference]: Finished difference Result 328 states and 485 transitions. [2025-03-03 14:19:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:19:24,210 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-03 14:19:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:24,218 INFO L225 Difference]: With dead ends: 328 [2025-03-03 14:19:24,218 INFO L226 Difference]: Without dead ends: 201 [2025-03-03 14:19:24,221 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-03 14:19:24,222 INFO L435 NwaCegarLoop]: 311 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, 311 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:24,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-03 14:19:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-03-03 14:19:24,263 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-03 14:19:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 303 transitions. [2025-03-03 14:19:24,273 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 303 transitions. Word has length 84 [2025-03-03 14:19:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:24,275 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 303 transitions. [2025-03-03 14:19:24,276 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-03 14:19:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 303 transitions. [2025-03-03 14:19:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 14:19:24,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:24,280 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] [2025-03-03 14:19:24,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:19:24,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:19:24,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:24,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:24,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1293676861, now seen corresponding path program 1 times [2025-03-03 14:19:24,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:24,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192479189] [2025-03-03 14:19:24,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:24,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:24,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:19:24,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:19:24,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:24,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:24,700 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-03 14:19:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:24,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192479189] [2025-03-03 14:19:24,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192479189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:24,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682842685] [2025-03-03 14:19:24,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:24,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:24,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:24,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:24,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:19:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:19:24,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:19:24,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:24,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:24,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:19:24,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:24,946 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-03 14:19:24,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:24,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682842685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:24,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:24,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:19:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668436088] [2025-03-03 14:19:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:24,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:24,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:24,951 INFO L87 Difference]: Start difference. First operand 201 states and 303 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-03 14:19:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:24,979 INFO L93 Difference]: Finished difference Result 317 states and 463 transitions. [2025-03-03 14:19:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:24,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 85 [2025-03-03 14:19:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:24,982 INFO L225 Difference]: With dead ends: 317 [2025-03-03 14:19:24,983 INFO L226 Difference]: Without dead ends: 203 [2025-03-03 14:19:24,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:24,985 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:24,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 602 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-03 14:19:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-03-03 14:19:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.548780487804878) internal successors, (254), 166 states have internal predecessors, (254), 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-03 14:19:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 305 transitions. [2025-03-03 14:19:25,001 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 305 transitions. Word has length 85 [2025-03-03 14:19:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:25,001 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 305 transitions. [2025-03-03 14:19:25,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-03 14:19:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 305 transitions. [2025-03-03 14:19:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:19:25,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:25,004 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:25,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:19:25,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:19:25,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1067409913, now seen corresponding path program 1 times [2025-03-03 14:19:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448411219] [2025-03-03 14:19:25,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:25,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:19:25,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:19:25,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:19:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:25,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448411219] [2025-03-03 14:19:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448411219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961231325] [2025-03-03 14:19:25,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:25,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:25,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:25,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:19:25,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:19:25,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:19:25,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:25,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:25,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:19:25,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:19:25,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:19:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961231325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:25,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:19:25,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:19:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334818946] [2025-03-03 14:19:25,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:25,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:25,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:19:25,618 INFO L87 Difference]: Start difference. First operand 203 states and 305 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), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:19:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:25,668 INFO L93 Difference]: Finished difference Result 399 states and 603 transitions. [2025-03-03 14:19:25,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:25,671 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), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2025-03-03 14:19:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:25,672 INFO L225 Difference]: With dead ends: 399 [2025-03-03 14:19:25,672 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 14:19:25,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:19:25,673 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 2 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:25,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1169 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:25,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 14:19:25,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-03 14:19:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 168 states have internal predecessors, (255), 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-03 14:19:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 308 transitions. [2025-03-03 14:19:25,698 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 308 transitions. Word has length 89 [2025-03-03 14:19:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:25,699 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 308 transitions. [2025-03-03 14:19:25,699 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), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:19:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 308 transitions. [2025-03-03 14:19:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:19:25,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:25,700 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-03 14:19:25,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:19:25,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:25,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:25,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1655019160, now seen corresponding path program 1 times [2025-03-03 14:19:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:25,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53082716] [2025-03-03 14:19:25,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:25,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:19:25,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:19:25,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:25,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:19:26,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:26,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53082716] [2025-03-03 14:19:26,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53082716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:26,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:26,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:26,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317288455] [2025-03-03 14:19:26,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:26,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:26,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:26,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:26,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:26,026 INFO L87 Difference]: Start difference. First operand 205 states and 308 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:19:26,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:26,069 INFO L93 Difference]: Finished difference Result 391 states and 591 transitions. [2025-03-03 14:19:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:26,070 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 90 [2025-03-03 14:19:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:26,071 INFO L225 Difference]: With dead ends: 391 [2025-03-03 14:19:26,073 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 14:19:26,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:26,074 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 2 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:26,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1173 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 14:19:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-03 14:19:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 168 states have internal predecessors, (255), 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-03 14:19:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 307 transitions. [2025-03-03 14:19:26,083 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 307 transitions. Word has length 90 [2025-03-03 14:19:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:26,084 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 307 transitions. [2025-03-03 14:19:26,084 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), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:19:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 307 transitions. [2025-03-03 14:19:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:19:26,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:26,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:26,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:19:26,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:26,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:26,086 INFO L85 PathProgramCache]: Analyzing trace with hash 473538485, now seen corresponding path program 2 times [2025-03-03 14:19:26,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:26,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128645322] [2025-03-03 14:19:26,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:19:26,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:26,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 91 statements into 2 equivalence classes. [2025-03-03 14:19:26,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 91 statements. [2025-03-03 14:19:26,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:19:26,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:19:26,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128645322] [2025-03-03 14:19:26,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128645322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:26,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206043639] [2025-03-03 14:19:26,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:26,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:26,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:26,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:26,194 INFO L87 Difference]: Start difference. First operand 205 states and 307 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03 14:19:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:26,238 INFO L93 Difference]: Finished difference Result 497 states and 747 transitions. [2025-03-03 14:19:26,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:19:26,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 91 [2025-03-03 14:19:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:26,240 INFO L225 Difference]: With dead ends: 497 [2025-03-03 14:19:26,240 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 14:19:26,241 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-03 14:19:26,242 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 264 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1176 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-03 14:19:26,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1176 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 14:19:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2025-03-03 14:19:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 315 states have (on average 1.561904761904762) internal successors, (492), 320 states have internal predecessors, (492), 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-03 14:19:26,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 589 transitions. [2025-03-03 14:19:26,265 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 589 transitions. Word has length 91 [2025-03-03 14:19:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:26,265 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 589 transitions. [2025-03-03 14:19:26,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-03 14:19:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 589 transitions. [2025-03-03 14:19:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:19:26,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:26,267 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:26,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:19:26,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:26,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash -208863055, now seen corresponding path program 1 times [2025-03-03 14:19:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:26,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452896183] [2025-03-03 14:19:26,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:26,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:19:26,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:19:26,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:26,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:19:26,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:26,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452896183] [2025-03-03 14:19:26,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452896183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:26,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:26,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797550278] [2025-03-03 14:19:26,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:26,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:26,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:26,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:26,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:26,387 INFO L87 Difference]: Start difference. First operand 389 states and 589 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:19:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:26,431 INFO L93 Difference]: Finished difference Result 761 states and 1158 transitions. [2025-03-03 14:19:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:26,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2025-03-03 14:19:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:26,434 INFO L225 Difference]: With dead ends: 761 [2025-03-03 14:19:26,434 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 14:19:26,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:26,436 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:26,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1176 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 14:19:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-03-03 14:19:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 316 states have (on average 1.5601265822784811) internal successors, (493), 322 states have internal predecessors, (493), 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-03 14:19:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 592 transitions. [2025-03-03 14:19:26,455 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 592 transitions. Word has length 92 [2025-03-03 14:19:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:26,455 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 592 transitions. [2025-03-03 14:19:26,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:19:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 592 transitions. [2025-03-03 14:19:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:19:26,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:26,457 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, 1, 1, 1] [2025-03-03 14:19:26,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:19:26,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:26,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 181153963, now seen corresponding path program 1 times [2025-03-03 14:19:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885684016] [2025-03-03 14:19:26,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:26,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:19:26,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:19:26,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:26,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885684016] [2025-03-03 14:19:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885684016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:19:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723224748] [2025-03-03 14:19:26,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:26,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:19:26,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:19:26,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:19:26,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:19:26,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:19:26,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:19:26,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:26,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:26,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:19:26,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:19:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:26,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:19:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:19:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723224748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:19:26,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:19:26,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:19:26,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185702208] [2025-03-03 14:19:26,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:19:26,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:26,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:26,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:26,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:26,862 INFO L87 Difference]: Start difference. First operand 391 states and 592 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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-03 14:19:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:26,921 INFO L93 Difference]: Finished difference Result 900 states and 1399 transitions. [2025-03-03 14:19:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:19:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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 93 [2025-03-03 14:19:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:26,925 INFO L225 Difference]: With dead ends: 900 [2025-03-03 14:19:26,925 INFO L226 Difference]: Without dead ends: 670 [2025-03-03 14:19:26,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 183 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-03 14:19:26,927 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 334 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:26,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1315 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-03 14:19:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 630. [2025-03-03 14:19:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 540 states have (on average 1.6703703703703703) internal successors, (902), 546 states have internal predecessors, (902), 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-03 14:19:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1031 transitions. [2025-03-03 14:19:26,958 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1031 transitions. Word has length 93 [2025-03-03 14:19:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:26,958 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 1031 transitions. [2025-03-03 14:19:26,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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-03 14:19:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1031 transitions. [2025-03-03 14:19:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:19:26,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:26,960 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, 1] [2025-03-03 14:19:26,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:19:27,161 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-03 14:19:27,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:27,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash 559864551, now seen corresponding path program 1 times [2025-03-03 14:19:27,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:27,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761147090] [2025-03-03 14:19:27,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:27,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:27,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:19:27,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:19:27,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:27,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:27,247 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-03 14:19:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761147090] [2025-03-03 14:19:27,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761147090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:27,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:27,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603762084] [2025-03-03 14:19:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:27,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:27,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:27,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,249 INFO L87 Difference]: Start difference. First operand 630 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03 14:19:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:27,273 INFO L93 Difference]: Finished difference Result 1485 states and 2478 transitions. [2025-03-03 14:19:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:27,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 100 [2025-03-03 14:19:27,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:27,277 INFO L225 Difference]: With dead ends: 1485 [2025-03-03 14:19:27,277 INFO L226 Difference]: Without dead ends: 882 [2025-03-03 14:19:27,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,279 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 84 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:27,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 601 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-03 14:19:27,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 866. [2025-03-03 14:19:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 761 states have (on average 1.7056504599211564) internal successors, (1298), 767 states have internal predecessors, (1298), 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-03 14:19:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1457 transitions. [2025-03-03 14:19:27,303 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1457 transitions. Word has length 100 [2025-03-03 14:19:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:27,304 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1457 transitions. [2025-03-03 14:19:27,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03 14:19:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1457 transitions. [2025-03-03 14:19:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:19:27,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:27,307 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, 1, 1] [2025-03-03 14:19:27,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:19:27,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:27,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:27,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1638146092, now seen corresponding path program 1 times [2025-03-03 14:19:27,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:27,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997504690] [2025-03-03 14:19:27,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:27,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:27,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:19:27,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:19:27,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:27,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:27,351 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-03 14:19:27,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997504690] [2025-03-03 14:19:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997504690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116200240] [2025-03-03 14:19:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:27,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:27,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:27,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,353 INFO L87 Difference]: Start difference. First operand 866 states and 1457 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (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-03 14:19:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:27,380 INFO L93 Difference]: Finished difference Result 2091 states and 3571 transitions. [2025-03-03 14:19:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:27,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (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 101 [2025-03-03 14:19:27,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:27,386 INFO L225 Difference]: With dead ends: 2091 [2025-03-03 14:19:27,386 INFO L226 Difference]: Without dead ends: 1259 [2025-03-03 14:19:27,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,390 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 82 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:27,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 608 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-03 14:19:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1243. [2025-03-03 14:19:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1114 states have (on average 1.7262118491921006) internal successors, (1923), 1120 states have internal predecessors, (1923), 103 states have call successors, (103), 23 states have call predecessors, (103), 25 states have return successors, (104), 99 states have call predecessors, (104), 101 states have call successors, (104) [2025-03-03 14:19:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2130 transitions. [2025-03-03 14:19:27,432 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2130 transitions. Word has length 101 [2025-03-03 14:19:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:27,433 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 2130 transitions. [2025-03-03 14:19:27,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (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-03 14:19:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2130 transitions. [2025-03-03 14:19:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:19:27,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:27,438 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, 1, 1, 1] [2025-03-03 14:19:27,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:19:27,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:27,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:27,438 INFO L85 PathProgramCache]: Analyzing trace with hash -641153754, now seen corresponding path program 1 times [2025-03-03 14:19:27,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:27,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159105409] [2025-03-03 14:19:27,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:27,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:27,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:19:27,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:19:27,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:27,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:27,485 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-03 14:19:27,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:27,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159105409] [2025-03-03 14:19:27,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159105409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:27,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:27,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896427059] [2025-03-03 14:19:27,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:27,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:27,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:27,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:27,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,487 INFO L87 Difference]: Start difference. First operand 1243 states and 2130 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-03 14:19:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:27,523 INFO L93 Difference]: Finished difference Result 3059 states and 5302 transitions. [2025-03-03 14:19:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 102 [2025-03-03 14:19:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:27,531 INFO L225 Difference]: With dead ends: 3059 [2025-03-03 14:19:27,531 INFO L226 Difference]: Without dead ends: 1867 [2025-03-03 14:19:27,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,535 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 80 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:27,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 608 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2025-03-03 14:19:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1851. [2025-03-03 14:19:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1683 states have (on average 1.7361853832442067) internal successors, (2922), 1689 states have internal predecessors, (2922), 142 states have call successors, (142), 23 states have call predecessors, (142), 25 states have return successors, (143), 138 states have call predecessors, (143), 140 states have call successors, (143) [2025-03-03 14:19:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 3207 transitions. [2025-03-03 14:19:27,596 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 3207 transitions. Word has length 102 [2025-03-03 14:19:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:27,597 INFO L471 AbstractCegarLoop]: Abstraction has 1851 states and 3207 transitions. [2025-03-03 14:19:27,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-03 14:19:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 3207 transitions. [2025-03-03 14:19:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:19:27,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:27,603 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, 1, 1, 1, 1] [2025-03-03 14:19:27,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:19:27,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:27,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:27,604 INFO L85 PathProgramCache]: Analyzing trace with hash -229812051, now seen corresponding path program 1 times [2025-03-03 14:19:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086528761] [2025-03-03 14:19:27,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:27,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:19:27,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:19:27,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:27,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:27,649 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-03 14:19:27,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:27,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086528761] [2025-03-03 14:19:27,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086528761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:27,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:27,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:27,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895455403] [2025-03-03 14:19:27,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:27,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:27,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:27,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:27,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,651 INFO L87 Difference]: Start difference. First operand 1851 states and 3207 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03 14:19:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:27,725 INFO L93 Difference]: Finished difference Result 4647 states and 8128 transitions. [2025-03-03 14:19:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:27,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 103 [2025-03-03 14:19:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:27,737 INFO L225 Difference]: With dead ends: 4647 [2025-03-03 14:19:27,738 INFO L226 Difference]: Without dead ends: 2882 [2025-03-03 14:19:27,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,742 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 78 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:27,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 608 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-03-03 14:19:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2866. [2025-03-03 14:19:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2632 states have (on average 1.7401215805471124) internal successors, (4580), 2638 states have internal predecessors, (4580), 208 states have call successors, (208), 23 states have call predecessors, (208), 25 states have return successors, (209), 204 states have call predecessors, (209), 206 states have call successors, (209) [2025-03-03 14:19:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4997 transitions. [2025-03-03 14:19:27,830 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4997 transitions. Word has length 103 [2025-03-03 14:19:27,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:27,830 INFO L471 AbstractCegarLoop]: Abstraction has 2866 states and 4997 transitions. [2025-03-03 14:19:27,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-03 14:19:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4997 transitions. [2025-03-03 14:19:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:19:27,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:27,838 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, 1, 1, 1, 1, 1] [2025-03-03 14:19:27,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:19:27,838 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:27,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2060291557, now seen corresponding path program 1 times [2025-03-03 14:19:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:27,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915608779] [2025-03-03 14:19:27,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:27,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:19:27,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:19:27,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:27,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:27,881 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-03 14:19:27,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:27,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915608779] [2025-03-03 14:19:27,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915608779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:27,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:27,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:19:27,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760417068] [2025-03-03 14:19:27,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:27,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:19:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:27,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:19:27,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,882 INFO L87 Difference]: Start difference. First operand 2866 states and 4997 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-03 14:19:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:27,963 INFO L93 Difference]: Finished difference Result 7369 states and 12958 transitions. [2025-03-03 14:19:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:19:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 104 [2025-03-03 14:19:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:27,986 INFO L225 Difference]: With dead ends: 7369 [2025-03-03 14:19:27,986 INFO L226 Difference]: Without dead ends: 4650 [2025-03-03 14:19:27,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:19:27,994 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 76 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:27,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 608 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2025-03-03 14:19:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4634. [2025-03-03 14:19:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4634 states, 4283 states have (on average 1.7408358627130516) internal successors, (7456), 4289 states have internal predecessors, (7456), 325 states have call successors, (325), 23 states have call predecessors, (325), 25 states have return successors, (326), 321 states have call predecessors, (326), 323 states have call successors, (326) [2025-03-03 14:19:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4634 states to 4634 states and 8107 transitions. [2025-03-03 14:19:28,167 INFO L78 Accepts]: Start accepts. Automaton has 4634 states and 8107 transitions. Word has length 104 [2025-03-03 14:19:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:28,167 INFO L471 AbstractCegarLoop]: Abstraction has 4634 states and 8107 transitions. [2025-03-03 14:19:28,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-03 14:19:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4634 states and 8107 transitions. [2025-03-03 14:19:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:19:28,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:28,182 INFO L218 NwaCegarLoop]: trace histogram [5, 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-03 14:19:28,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:19:28,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:28,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:28,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1375507465, now seen corresponding path program 2 times [2025-03-03 14:19:28,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:28,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156601638] [2025-03-03 14:19:28,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:19:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:28,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-03 14:19:28,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 51 of 105 statements. [2025-03-03 14:19:28,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:19:28,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:19:28,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:28,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156601638] [2025-03-03 14:19:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156601638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:28,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:19:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777568289] [2025-03-03 14:19:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:28,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:28,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:28,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:28,262 INFO L87 Difference]: Start difference. First operand 4634 states and 8107 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 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-03 14:19:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:28,334 INFO L93 Difference]: Finished difference Result 4634 states and 8107 transitions. [2025-03-03 14:19:28,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:19:28,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 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 105 [2025-03-03 14:19:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:28,336 INFO L225 Difference]: With dead ends: 4634 [2025-03-03 14:19:28,336 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:19:28,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:28,345 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 0 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:28,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1773 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:19:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:19:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:19:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:19:28,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2025-03-03 14:19:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:28,346 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:19:28,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 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-03 14:19:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:19:28,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:19:28,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoing__wrappee__BaseErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:19:28,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:19:28,352 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:28,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:19:28,442 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:19:28,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:19:28 BoogieIcfgContainer [2025-03-03 14:19:28,449 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:19:28,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:19:28,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:19:28,449 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:19:28,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:19:23" (3/4) ... [2025-03-03 14:19:28,451 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing__wrappee__Base [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookSize [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sendEmail [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getClientAddressBookSize [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getClientAddressBookAddress [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookAddress [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isReadable [2025-03-03 14:19:28,455 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientId [2025-03-03 14:19:28,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2025-03-03 14:19:28,469 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-03 14:19:28,469 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-03 14:19:28,470 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-03 14:19:28,471 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:19:28,471 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:19:28,575 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:19:28,575 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:19:28,575 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:19:28,576 INFO L158 Benchmark]: Toolchain (without parser) took 6654.50ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 103.3MB in the beginning and 101.7MB in the end (delta: 1.7MB). Peak memory consumption was 171.7MB. Max. memory is 16.1GB. [2025-03-03 14:19:28,577 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:19:28,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.29ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 68.4MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 14:19:28,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.99ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 63.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:19:28,577 INFO L158 Benchmark]: Boogie Preprocessor took 67.01ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 59.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:19:28,577 INFO L158 Benchmark]: IcfgBuilder took 775.54ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 76.2MB in the end (delta: -17.2MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2025-03-03 14:19:28,577 INFO L158 Benchmark]: TraceAbstraction took 5121.00ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 75.4MB in the beginning and 115.2MB in the end (delta: -39.8MB). Peak memory consumption was 122.4MB. Max. memory is 16.1GB. [2025-03-03 14:19:28,577 INFO L158 Benchmark]: Witness Printer took 126.40ms. Allocated memory is still 310.4MB. Free memory was 115.2MB in the beginning and 101.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:19:28,578 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.29ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 68.4MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.99ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 63.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.01ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 59.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 775.54ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 76.2MB in the end (delta: -17.2MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5121.00ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 75.4MB in the beginning and 115.2MB in the end (delta: -39.8MB). Peak memory consumption was 122.4MB. Max. memory is 16.1GB. * Witness Printer took 126.40ms. Allocated memory is still 310.4MB. Free memory was 115.2MB in the beginning and 101.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 48]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"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, 208 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1038 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1003 mSDsluCounter, 11728 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7787 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 191 IncrementalHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 3941 mSDtfsCounter, 191 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4634occurred in iteration=12, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 122 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1590 NumberOfCodeBlocks, 1494 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1665 ConstructedInterpolants, 0 QuantifiedInterpolants, 1925 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3353 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 404/419 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 14:19:28,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE