./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product22.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_spec11_product22.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 25d1aac916acb353bef6b5512adabc0f3abdf00fe5619505211974e4efa18990 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:20:34,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:20:34,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:20:34,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:20:34,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:20:34,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:20:34,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:20:34,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:20:34,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:20:34,567 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:20:34,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:20:34,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:20:34,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:20:34,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:20:34,567 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:20:34,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:20:34,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:20:34,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:20:34,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:20:34,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:20:34,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:34,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:20:34,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:20:34,570 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 -> 25d1aac916acb353bef6b5512adabc0f3abdf00fe5619505211974e4efa18990 [2025-03-03 14:20:34,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:20:34,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:20:34,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:20:34,814 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:20:34,815 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:20:34,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product22.cil.c [2025-03-03 14:20:36,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61868023/1013ec7c03764d56830ba240b2975893/FLAG2feed7618 [2025-03-03 14:20:36,364 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:20:36,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product22.cil.c [2025-03-03 14:20:36,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61868023/1013ec7c03764d56830ba240b2975893/FLAG2feed7618 [2025-03-03 14:20:36,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f61868023/1013ec7c03764d56830ba240b2975893 [2025-03-03 14:20:36,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:20:36,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:20:36,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:20:36,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:20:36,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:20:36,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:20:36" (1/1) ... [2025-03-03 14:20:36,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdd71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:36, skipping insertion in model container [2025-03-03 14:20:36,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:20:36" (1/1) ... [2025-03-03 14:20:36,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:20:36,776 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_spec11_product22.cil.c[40875,40888] [2025-03-03 14:20:36,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:20:36,900 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:20:36,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-03-03 14:20:36,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [66] [2025-03-03 14:20:36,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [99] [2025-03-03 14:20:36,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [210] [2025-03-03 14:20:36,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [520] [2025-03-03 14:20:36,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [749] [2025-03-03 14:20:36,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1822] [2025-03-03 14:20:36,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1831] [2025-03-03 14:20:36,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2119] [2025-03-03 14:20:36,910 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2485] [2025-03-03 14:20:36,911 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2520] [2025-03-03 14:20:36,953 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_spec11_product22.cil.c[40875,40888] [2025-03-03 14:20:36,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:20:37,020 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:20:37,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37 WrapperNode [2025-03-03 14:20:37,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:20:37,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:20:37,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:20:37,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:20:37,026 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:20:37" (1/1) ... [2025-03-03 14:20:37,045 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:20:37" (1/1) ... [2025-03-03 14:20:37,089 INFO L138 Inliner]: procedures = 128, calls = 189, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1015 [2025-03-03 14:20:37,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:20:37,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:20:37,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:20:37,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:20:37,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,117 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:20:37,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:20:37,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:20:37,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:20:37,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:20:37,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (1/1) ... [2025-03-03 14:20:37,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:37,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:37,181 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:20:37,184 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:20:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:20:37,208 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:20:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:20:37,208 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:20:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:20:37,208 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:20:37,208 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:20:37,209 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:20:37,209 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:20:37,209 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:20:37,209 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:20:37,209 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:20:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:20:37,210 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:20:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:20:37,210 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:20:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:20:37,210 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:20:37,210 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:20:37,210 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:20:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:20:37,211 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:20:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:20:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:20:37,211 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:20:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:20:37,211 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:20:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:20:37,211 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:20:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:20:37,211 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:20:37,211 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:20:37,211 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:20:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:20:37,213 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:20:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:20:37,213 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:20:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:20:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:20:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:20:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:20:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:20:37,213 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:20:37,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:20:37,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:20:37,391 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:20:37,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:20:37,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1680-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~24#1; [2025-03-03 14:20:37,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~18#1; [2025-03-03 14:20:37,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L475-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~9#1; [2025-03-03 14:20:37,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567-1: getEmailId_#res#1 := getEmailId_~retValue_acc~34#1; [2025-03-03 14:20:37,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1799-1: getClientId_#res#1 := getClientId_~retValue_acc~26#1; [2025-03-03 14:20:37,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~25#1; [2025-03-03 14:20:37,695 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1364-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~19#1; [2025-03-03 14:20:37,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1456: #res#1 := ~retValue_acc~21#1; [2025-03-03 14:20:37,720 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1411-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~20#1; [2025-03-03 14:20:37,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L207-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-03-03 14:20:37,743 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2756: #res := ~retValue_acc~39; [2025-03-03 14:20:37,753 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2793: #res := ~retValue_acc~40; [2025-03-03 14:20:37,776 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2641: #res := ~retValue_acc~36; [2025-03-03 14:20:37,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L432-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~6#1; [2025-03-03 14:20:37,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L441-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~7#1; [2025-03-03 14:20:37,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L450-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~8#1; [2025-03-03 14:20:37,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517-1: valid_product_#res#1 := valid_product_~retValue_acc~32#1; [2025-03-03 14:20:37,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1626-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~23#1; [2025-03-03 14:20:37,994 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1519-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~22#1; [2025-03-03 14:20:38,000 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2604: #res := ~retValue_acc~35; [2025-03-03 14:20:38,008 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L183: #res#1 := ~retValue_acc~2#1; [2025-03-03 14:20:38,008 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L163-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~1#1; [2025-03-03 14:20:38,118 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-03-03 14:20:38,119 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:20:38,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:20:38,136 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:20:38,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:20:38 BoogieIcfgContainer [2025-03-03 14:20:38,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:20:38,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:20:38,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:20:38,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:20:38,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:20:36" (1/3) ... [2025-03-03 14:20:38,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be2ae41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:20:38, skipping insertion in model container [2025-03-03 14:20:38,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:37" (2/3) ... [2025-03-03 14:20:38,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be2ae41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:20:38, skipping insertion in model container [2025-03-03 14:20:38,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:20:38" (3/3) ... [2025-03-03 14:20:38,145 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product22.cil.c [2025-03-03 14:20:38,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:20:38,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product22.cil.c that has 20 procedures, 321 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:20:38,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:20:38,243 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;@61e9ca45, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:20:38,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:20:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 321 states, 250 states have (on average 1.524) internal successors, (381), 254 states have internal predecessors, (381), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:20:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:20:38,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:38,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:38,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:38,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash -383259236, now seen corresponding path program 1 times [2025-03-03 14:20:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:38,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663421411] [2025-03-03 14:20:38,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:38,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:38,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:20:38,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:20:38,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:38,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:20:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:38,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663421411] [2025-03-03 14:20:38,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663421411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:38,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888603757] [2025-03-03 14:20:38,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:38,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:38,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:38,889 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:20:38,891 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:20:39,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:20:39,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:20:39,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:39,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:39,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:20:39,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:20:39,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888603757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:20:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269949407] [2025-03-03 14:20:39,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:39,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:20:39,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:39,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:20:39,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:39,198 INFO L87 Difference]: Start difference. First operand has 321 states, 250 states have (on average 1.524) internal successors, (381), 254 states have internal predecessors, (381), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:39,248 INFO L93 Difference]: Finished difference Result 484 states and 710 transitions. [2025-03-03 14:20:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:20:39,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-03-03 14:20:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:39,258 INFO L225 Difference]: With dead ends: 484 [2025-03-03 14:20:39,261 INFO L226 Difference]: Without dead ends: 314 [2025-03-03 14:20:39,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 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:20:39,269 INFO L435 NwaCegarLoop]: 478 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, 478 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:20:39,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-03 14:20:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-03 14:20:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 244 states have (on average 1.5204918032786885) internal successors, (371), 247 states have internal predecessors, (371), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:20:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 470 transitions. [2025-03-03 14:20:39,324 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 470 transitions. Word has length 109 [2025-03-03 14:20:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:39,328 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 470 transitions. [2025-03-03 14:20:39,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 470 transitions. [2025-03-03 14:20:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:20:39,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:39,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:39,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:20:39,538 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:20:39,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:39,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 558667408, now seen corresponding path program 1 times [2025-03-03 14:20:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006849212] [2025-03-03 14:20:39,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:39,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:20:39,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:20:39,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:39,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:39,800 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:20:39,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:39,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006849212] [2025-03-03 14:20:39,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006849212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:39,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213169956] [2025-03-03 14:20:39,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:39,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:39,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:39,807 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:20:39,809 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:20:39,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:20:40,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:20:40,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:40,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:40,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:20:40,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:20:40,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213169956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:20:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315264885] [2025-03-03 14:20:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:40,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:40,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:40,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:40,113 INFO L87 Difference]: Start difference. First operand 314 states and 470 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:40,149 INFO L93 Difference]: Finished difference Result 473 states and 691 transitions. [2025-03-03 14:20:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:40,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-03-03 14:20:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:40,152 INFO L225 Difference]: With dead ends: 473 [2025-03-03 14:20:40,152 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 14:20:40,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 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:20:40,153 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 936 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:20:40,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 936 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 14:20:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-03 14:20:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 246 states have (on average 1.516260162601626) internal successors, (373), 249 states have internal predecessors, (373), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-03 14:20:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2025-03-03 14:20:40,177 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 110 [2025-03-03 14:20:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:40,178 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2025-03-03 14:20:40,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2025-03-03 14:20:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:20:40,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:40,182 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:40,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:20:40,383 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:20:40,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:40,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash 679863532, now seen corresponding path program 1 times [2025-03-03 14:20:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:40,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818301625] [2025-03-03 14:20:40,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:40,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:20:40,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:20:40,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:40,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:20:40,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:40,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818301625] [2025-03-03 14:20:40,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818301625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:40,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087396431] [2025-03-03 14:20:40,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:40,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:40,580 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:20:40,582 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:20:40,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:20:40,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:20:40,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:40,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:40,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:40,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:20:40,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:40,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087396431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:40,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:40,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:20:40,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803351670] [2025-03-03 14:20:40,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:40,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:40,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:40,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:40,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:40,877 INFO L87 Difference]: Start difference. First operand 316 states and 472 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:40,911 INFO L93 Difference]: Finished difference Result 666 states and 1010 transitions. [2025-03-03 14:20:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:40,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2025-03-03 14:20:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:40,914 INFO L225 Difference]: With dead ends: 666 [2025-03-03 14:20:40,914 INFO L226 Difference]: Without dead ends: 377 [2025-03-03 14:20:40,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 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:20:40,916 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 115 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 922 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:20:40,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 922 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-03 14:20:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 369. [2025-03-03 14:20:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 288 states have (on average 1.5347222222222223) internal successors, (442), 291 states have internal predecessors, (442), 61 states have call successors, (61), 19 states have call predecessors, (61), 19 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 14:20:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 563 transitions. [2025-03-03 14:20:40,930 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 563 transitions. Word has length 118 [2025-03-03 14:20:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:40,931 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 563 transitions. [2025-03-03 14:20:40,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 563 transitions. [2025-03-03 14:20:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:20:40,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:40,933 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:40,940 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:20:41,133 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:20:41,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:41,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1930906818, now seen corresponding path program 1 times [2025-03-03 14:20:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301144142] [2025-03-03 14:20:41,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:41,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:20:41,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:20:41,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:41,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:20:41,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:41,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301144142] [2025-03-03 14:20:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301144142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:41,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710974245] [2025-03-03 14:20:41,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:41,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:41,276 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:20:41,278 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:20:41,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:20:41,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:20:41,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:41,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:41,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:20:41,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:20:41,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:41,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710974245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:41,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:41,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:20:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445704426] [2025-03-03 14:20:41,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:41,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:41,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:41,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:41,551 INFO L87 Difference]: Start difference. First operand 369 states and 563 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:41,601 INFO L93 Difference]: Finished difference Result 729 states and 1116 transitions. [2025-03-03 14:20:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 119 [2025-03-03 14:20:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:41,604 INFO L225 Difference]: With dead ends: 729 [2025-03-03 14:20:41,604 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 14:20:41,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 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:20:41,606 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1837 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:20:41,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1837 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 14:20:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-03-03 14:20:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 289 states have (on average 1.532871972318339) internal successors, (443), 293 states have internal predecessors, (443), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-03-03 14:20:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 566 transitions. [2025-03-03 14:20:41,619 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 566 transitions. Word has length 119 [2025-03-03 14:20:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:41,619 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 566 transitions. [2025-03-03 14:20:41,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 566 transitions. [2025-03-03 14:20:41,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:20:41,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:41,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:41,632 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:20:41,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:41,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:41,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:41,823 INFO L85 PathProgramCache]: Analyzing trace with hash 923301748, now seen corresponding path program 1 times [2025-03-03 14:20:41,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874270773] [2025-03-03 14:20:41,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:41,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:41,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:20:41,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:20:41,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:41,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:20:41,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:41,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874270773] [2025-03-03 14:20:41,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874270773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:41,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353375650] [2025-03-03 14:20:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:41,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:41,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:41,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:20:41,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:20:42,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:20:42,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:20:42,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:42,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:42,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:20:42,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:20:42,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353375650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:42,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:42,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:20:42,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358745653] [2025-03-03 14:20:42,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:42,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:42,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:42,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:42,251 INFO L87 Difference]: Start difference. First operand 371 states and 566 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:42,319 INFO L93 Difference]: Finished difference Result 731 states and 1121 transitions. [2025-03-03 14:20:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:42,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2025-03-03 14:20:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:42,322 INFO L225 Difference]: With dead ends: 731 [2025-03-03 14:20:42,322 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 14:20:42,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:42,325 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 2 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:42,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1823 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 14:20:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-03 14:20:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 290 states have (on average 1.5310344827586206) internal successors, (444), 295 states have internal predecessors, (444), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-03-03 14:20:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 572 transitions. [2025-03-03 14:20:42,339 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 572 transitions. Word has length 120 [2025-03-03 14:20:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:42,339 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 572 transitions. [2025-03-03 14:20:42,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 572 transitions. [2025-03-03 14:20:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:20:42,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:42,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:42,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:20:42,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:42,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:42,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1284454780, now seen corresponding path program 1 times [2025-03-03 14:20:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:42,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46470301] [2025-03-03 14:20:42,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:42,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:20:42,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:20:42,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:42,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:20:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:42,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46470301] [2025-03-03 14:20:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46470301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:42,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047832731] [2025-03-03 14:20:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:42,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:42,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:42,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:42,675 INFO L87 Difference]: Start difference. First operand 373 states and 572 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:42,716 INFO L93 Difference]: Finished difference Result 723 states and 1112 transitions. [2025-03-03 14:20:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:42,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 121 [2025-03-03 14:20:42,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:42,720 INFO L225 Difference]: With dead ends: 723 [2025-03-03 14:20:42,722 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 14:20:42,724 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:20:42,724 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1841 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:20:42,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1841 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 14:20:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-03 14:20:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 290 states have (on average 1.5310344827586206) internal successors, (444), 295 states have internal predecessors, (444), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-03-03 14:20:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 571 transitions. [2025-03-03 14:20:42,751 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 571 transitions. Word has length 121 [2025-03-03 14:20:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:42,751 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 571 transitions. [2025-03-03 14:20:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 571 transitions. [2025-03-03 14:20:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:20:42,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:42,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:42,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:20:42,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:42,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash 194036700, now seen corresponding path program 2 times [2025-03-03 14:20:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207769757] [2025-03-03 14:20:42,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:20:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:42,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-03 14:20:42,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 60 of 122 statements. [2025-03-03 14:20:42,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:20:42,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:20:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207769757] [2025-03-03 14:20:42,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207769757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:42,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:42,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:20:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686081192] [2025-03-03 14:20:42,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:42,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:20:42,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:42,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:20:42,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:42,893 INFO L87 Difference]: Start difference. First operand 373 states and 571 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:43,207 INFO L93 Difference]: Finished difference Result 933 states and 1416 transitions. [2025-03-03 14:20:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:20:43,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 122 [2025-03-03 14:20:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:43,211 INFO L225 Difference]: With dead ends: 933 [2025-03-03 14:20:43,211 INFO L226 Difference]: Without dead ends: 784 [2025-03-03 14:20:43,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:20:43,213 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 494 mSDsluCounter, 2332 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:43,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2832 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:20:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-03-03 14:20:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 725. [2025-03-03 14:20:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 568 states have (on average 1.5422535211267605) internal successors, (876), 575 states have internal predecessors, (876), 116 states have call successors, (116), 38 states have call predecessors, (116), 40 states have return successors, (127), 115 states have call predecessors, (127), 114 states have call successors, (127) [2025-03-03 14:20:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1119 transitions. [2025-03-03 14:20:43,254 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1119 transitions. Word has length 122 [2025-03-03 14:20:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:43,254 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1119 transitions. [2025-03-03 14:20:43,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1119 transitions. [2025-03-03 14:20:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:20:43,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:43,257 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:43,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:20:43,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:43,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1889201896, now seen corresponding path program 1 times [2025-03-03 14:20:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:43,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795249712] [2025-03-03 14:20:43,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:43,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:20:43,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:20:43,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:43,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:20:43,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795249712] [2025-03-03 14:20:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795249712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803199006] [2025-03-03 14:20:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:43,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:43,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:43,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:43,367 INFO L87 Difference]: Start difference. First operand 725 states and 1119 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:43,409 INFO L93 Difference]: Finished difference Result 1429 states and 2211 transitions. [2025-03-03 14:20:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:43,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-03-03 14:20:43,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:43,414 INFO L225 Difference]: With dead ends: 1429 [2025-03-03 14:20:43,414 INFO L226 Difference]: Without dead ends: 727 [2025-03-03 14:20:43,419 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:20:43,419 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1844 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:20:43,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1844 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-03 14:20:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-03-03 14:20:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 569 states have (on average 1.5413005272407734) internal successors, (877), 577 states have internal predecessors, (877), 116 states have call successors, (116), 38 states have call predecessors, (116), 41 states have return successors, (129), 115 states have call predecessors, (129), 114 states have call successors, (129) [2025-03-03 14:20:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1122 transitions. [2025-03-03 14:20:43,458 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1122 transitions. Word has length 123 [2025-03-03 14:20:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:43,459 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1122 transitions. [2025-03-03 14:20:43,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1122 transitions. [2025-03-03 14:20:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:20:43,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:43,462 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:43,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:20:43,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:43,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash -788757731, now seen corresponding path program 1 times [2025-03-03 14:20:43,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872632751] [2025-03-03 14:20:43,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:43,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:20:43,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:20:43,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:43,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:20:43,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872632751] [2025-03-03 14:20:43,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872632751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:43,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:43,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:43,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143942969] [2025-03-03 14:20:43,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:43,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:43,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:43,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:43,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:43,575 INFO L87 Difference]: Start difference. First operand 727 states and 1122 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:20:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:43,683 INFO L93 Difference]: Finished difference Result 1075 states and 1658 transitions. [2025-03-03 14:20:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:20:43,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 124 [2025-03-03 14:20:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:43,709 INFO L225 Difference]: With dead ends: 1075 [2025-03-03 14:20:43,709 INFO L226 Difference]: Without dead ends: 377 [2025-03-03 14:20:43,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:20:43,712 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 7 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:43,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3149 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-03 14:20:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-03 14:20:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 293 states have (on average 1.5255972696245734) internal successors, (447), 298 states have internal predecessors, (447), 61 states have call successors, (61), 20 states have call predecessors, (61), 22 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-03-03 14:20:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 575 transitions. [2025-03-03 14:20:43,723 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 575 transitions. Word has length 124 [2025-03-03 14:20:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:43,723 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 575 transitions. [2025-03-03 14:20:43,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:20:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 575 transitions. [2025-03-03 14:20:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:20:43,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:43,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:43,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:20:43,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:43,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2074864003, now seen corresponding path program 1 times [2025-03-03 14:20:43,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:43,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388736168] [2025-03-03 14:20:43,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:43,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:43,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:20:43,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:20:43,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:43,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:20:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388736168] [2025-03-03 14:20:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388736168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:43,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076761389] [2025-03-03 14:20:43,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:43,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:43,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:43,846 INFO L87 Difference]: Start difference. First operand 377 states and 575 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:20:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:43,965 INFO L93 Difference]: Finished difference Result 730 states and 1121 transitions. [2025-03-03 14:20:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:20:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 124 [2025-03-03 14:20:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:43,968 INFO L225 Difference]: With dead ends: 730 [2025-03-03 14:20:43,968 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 14:20:43,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:20:43,970 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 5 mSDsluCounter, 2707 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:43,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3163 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 14:20:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-03 14:20:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 295 states have (on average 1.5220338983050847) internal successors, (449), 301 states have internal predecessors, (449), 61 states have call successors, (61), 20 states have call predecessors, (61), 23 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-03-03 14:20:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 582 transitions. [2025-03-03 14:20:43,985 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 582 transitions. Word has length 124 [2025-03-03 14:20:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:43,985 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 582 transitions. [2025-03-03 14:20:43,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:20:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 582 transitions. [2025-03-03 14:20:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:20:43,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:43,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:43,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:20:43,989 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:43,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash 833250890, now seen corresponding path program 1 times [2025-03-03 14:20:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:43,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568974925] [2025-03-03 14:20:43,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:43,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:44,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:20:44,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:20:44,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:44,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:20:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568974925] [2025-03-03 14:20:44,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568974925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:44,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623293803] [2025-03-03 14:20:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:44,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:44,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:44,115 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:20:44,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:20:44,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:20:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:20:44,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:44,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:44,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:44,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:44,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:20:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623293803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:20:44,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:20:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:20:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794079618] [2025-03-03 14:20:44,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:20:44,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:20:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:44,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:20:44,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:44,497 INFO L87 Difference]: Start difference. First operand 380 states and 582 transitions. Second operand has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:20:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:44,968 INFO L93 Difference]: Finished difference Result 1102 states and 1766 transitions. [2025-03-03 14:20:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:20:44,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 125 [2025-03-03 14:20:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:44,973 INFO L225 Difference]: With dead ends: 1102 [2025-03-03 14:20:44,973 INFO L226 Difference]: Without dead ends: 754 [2025-03-03 14:20:44,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:20:44,975 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1259 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:44,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 2974 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:20:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-03 14:20:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 730. [2025-03-03 14:20:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 581 states have (on average 1.5783132530120483) internal successors, (917), 586 states have internal predecessors, (917), 125 states have call successors, (125), 21 states have call predecessors, (125), 23 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2025-03-03 14:20:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1188 transitions. [2025-03-03 14:20:45,005 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1188 transitions. Word has length 125 [2025-03-03 14:20:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:45,006 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1188 transitions. [2025-03-03 14:20:45,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:20:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1188 transitions. [2025-03-03 14:20:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:20:45,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:45,011 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:45,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:20:45,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:45,215 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:45,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -953762519, now seen corresponding path program 1 times [2025-03-03 14:20:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656113364] [2025-03-03 14:20:45,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:45,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:20:45,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:20:45,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:45,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:45,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656113364] [2025-03-03 14:20:45,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656113364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:45,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:45,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:45,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299635604] [2025-03-03 14:20:45,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:45,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:45,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:45,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:45,283 INFO L87 Difference]: Start difference. First operand 730 states and 1188 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:45,316 INFO L93 Difference]: Finished difference Result 1707 states and 2826 transitions. [2025-03-03 14:20:45,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:45,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-03-03 14:20:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:45,322 INFO L225 Difference]: With dead ends: 1707 [2025-03-03 14:20:45,322 INFO L226 Difference]: Without dead ends: 1058 [2025-03-03 14:20:45,325 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:20:45,325 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 112 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 950 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:20:45,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 950 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-03-03 14:20:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1050. [2025-03-03 14:20:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 837 states have (on average 1.5973715651135005) internal successors, (1337), 842 states have internal predecessors, (1337), 189 states have call successors, (189), 21 states have call predecessors, (189), 23 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2025-03-03 14:20:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1746 transitions. [2025-03-03 14:20:45,365 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1746 transitions. Word has length 128 [2025-03-03 14:20:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:45,366 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1746 transitions. [2025-03-03 14:20:45,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1746 transitions. [2025-03-03 14:20:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:20:45,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:45,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:45,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:20:45,371 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:45,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:45,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1080965362, now seen corresponding path program 1 times [2025-03-03 14:20:45,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:45,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303657531] [2025-03-03 14:20:45,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:45,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:45,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:20:45,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:20:45,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:45,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303657531] [2025-03-03 14:20:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303657531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:45,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:45,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:45,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766901242] [2025-03-03 14:20:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:45,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:45,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:45,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:45,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:45,463 INFO L87 Difference]: Start difference. First operand 1050 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:45,527 INFO L93 Difference]: Finished difference Result 2501 states and 4183 transitions. [2025-03-03 14:20:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:45,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-03-03 14:20:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:45,540 INFO L225 Difference]: With dead ends: 2501 [2025-03-03 14:20:45,540 INFO L226 Difference]: Without dead ends: 1583 [2025-03-03 14:20:45,544 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:20:45,545 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 110 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 932 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:20:45,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 932 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-03 14:20:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1575. [2025-03-03 14:20:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1267 states have (on average 1.606156274664562) internal successors, (2035), 1272 states have internal predecessors, (2035), 284 states have call successors, (284), 21 states have call predecessors, (284), 23 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2025-03-03 14:20:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2634 transitions. [2025-03-03 14:20:45,627 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2634 transitions. Word has length 129 [2025-03-03 14:20:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:45,629 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2634 transitions. [2025-03-03 14:20:45,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2634 transitions. [2025-03-03 14:20:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:20:45,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:45,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:45,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:20:45,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:45,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:45,639 INFO L85 PathProgramCache]: Analyzing trace with hash -103081814, now seen corresponding path program 1 times [2025-03-03 14:20:45,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:45,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182590678] [2025-03-03 14:20:45,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:45,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:20:45,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:20:45,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:45,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:45,706 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:45,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182590678] [2025-03-03 14:20:45,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182590678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:45,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:45,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:45,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447833579] [2025-03-03 14:20:45,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:45,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:45,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:45,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:45,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:45,708 INFO L87 Difference]: Start difference. First operand 1575 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:45,782 INFO L93 Difference]: Finished difference Result 3690 states and 6217 transitions. [2025-03-03 14:20:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:45,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-03-03 14:20:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:45,798 INFO L225 Difference]: With dead ends: 3690 [2025-03-03 14:20:45,798 INFO L226 Difference]: Without dead ends: 2379 [2025-03-03 14:20:45,804 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:20:45,805 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 108 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 927 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:20:45,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 927 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-03 14:20:45,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2371. [2025-03-03 14:20:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1940 states have (on average 1.6128865979381444) internal successors, (3129), 1945 states have internal predecessors, (3129), 407 states have call successors, (407), 21 states have call predecessors, (407), 23 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2025-03-03 14:20:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3990 transitions. [2025-03-03 14:20:45,917 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3990 transitions. Word has length 130 [2025-03-03 14:20:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:45,918 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3990 transitions. [2025-03-03 14:20:45,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3990 transitions. [2025-03-03 14:20:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:20:45,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:45,928 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:45,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:20:45,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:45,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1102872623, now seen corresponding path program 1 times [2025-03-03 14:20:45,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:45,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588467642] [2025-03-03 14:20:45,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:45,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:20:45,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:20:45,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:45,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:46,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:46,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588467642] [2025-03-03 14:20:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588467642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:46,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:46,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:46,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189304311] [2025-03-03 14:20:46,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:46,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:46,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:46,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:46,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:46,019 INFO L87 Difference]: Start difference. First operand 2371 states and 3990 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:46,111 INFO L93 Difference]: Finished difference Result 5543 states and 9389 transitions. [2025-03-03 14:20:46,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:46,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2025-03-03 14:20:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:46,130 INFO L225 Difference]: With dead ends: 5543 [2025-03-03 14:20:46,131 INFO L226 Difference]: Without dead ends: 3651 [2025-03-03 14:20:46,138 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:20:46,139 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 106 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 927 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:20:46,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 927 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2025-03-03 14:20:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3643. [2025-03-03 14:20:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3643 states, 3033 states have (on average 1.6172106824925816) internal successors, (4905), 3038 states have internal predecessors, (4905), 586 states have call successors, (586), 21 states have call predecessors, (586), 23 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2025-03-03 14:20:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 6150 transitions. [2025-03-03 14:20:46,291 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 6150 transitions. Word has length 131 [2025-03-03 14:20:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:46,291 INFO L471 AbstractCegarLoop]: Abstraction has 3643 states and 6150 transitions. [2025-03-03 14:20:46,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 6150 transitions. [2025-03-03 14:20:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:20:46,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:46,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:46,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:20:46,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:46,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1665087733, now seen corresponding path program 1 times [2025-03-03 14:20:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610424986] [2025-03-03 14:20:46,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:46,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:20:46,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:20:46,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:46,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610424986] [2025-03-03 14:20:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610424986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:46,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155404821] [2025-03-03 14:20:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:46,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:46,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:46,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:46,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:46,355 INFO L87 Difference]: Start difference. First operand 3643 states and 6150 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:46,533 INFO L93 Difference]: Finished difference Result 8590 states and 14597 transitions. [2025-03-03 14:20:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:46,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-03-03 14:20:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:46,565 INFO L225 Difference]: With dead ends: 8590 [2025-03-03 14:20:46,565 INFO L226 Difference]: Without dead ends: 5753 [2025-03-03 14:20:46,576 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:20:46,577 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 104 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 941 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:20:46,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 941 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2025-03-03 14:20:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 5745. [2025-03-03 14:20:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5745 states, 4759 states have (on average 1.6121033830636688) internal successors, (7672), 4764 states have internal predecessors, (7672), 962 states have call successors, (962), 21 states have call predecessors, (962), 23 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2025-03-03 14:20:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5745 states to 5745 states and 9713 transitions. [2025-03-03 14:20:46,876 INFO L78 Accepts]: Start accepts. Automaton has 5745 states and 9713 transitions. Word has length 132 [2025-03-03 14:20:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:46,877 INFO L471 AbstractCegarLoop]: Abstraction has 5745 states and 9713 transitions. [2025-03-03 14:20:46,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5745 states and 9713 transitions. [2025-03-03 14:20:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:20:46,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:46,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:46,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:20:46,897 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:46,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash -432320336, now seen corresponding path program 1 times [2025-03-03 14:20:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:46,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57714730] [2025-03-03 14:20:46,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:46,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:20:46,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:20:46,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:46,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:46,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:46,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57714730] [2025-03-03 14:20:46,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57714730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:46,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:46,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:46,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374071902] [2025-03-03 14:20:46,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:46,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:46,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:46,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:46,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:46,945 INFO L87 Difference]: Start difference. First operand 5745 states and 9713 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:47,216 INFO L93 Difference]: Finished difference Result 14102 states and 23994 transitions. [2025-03-03 14:20:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:47,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2025-03-03 14:20:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:47,266 INFO L225 Difference]: With dead ends: 14102 [2025-03-03 14:20:47,266 INFO L226 Difference]: Without dead ends: 9559 [2025-03-03 14:20:47,284 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:20:47,284 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 102 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 930 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:20:47,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9559 states. [2025-03-03 14:20:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9559 to 9551. [2025-03-03 14:20:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9551 states, 7959 states have (on average 1.6106294760648323) internal successors, (12819), 7964 states have internal predecessors, (12819), 1568 states have call successors, (1568), 21 states have call predecessors, (1568), 23 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2025-03-03 14:20:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9551 states to 9551 states and 16150 transitions. [2025-03-03 14:20:47,767 INFO L78 Accepts]: Start accepts. Automaton has 9551 states and 16150 transitions. Word has length 133 [2025-03-03 14:20:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 9551 states and 16150 transitions. [2025-03-03 14:20:47,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 9551 states and 16150 transitions. [2025-03-03 14:20:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:20:47,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:47,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:47,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:20:47,798 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:47,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 267413324, now seen corresponding path program 1 times [2025-03-03 14:20:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:47,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345863292] [2025-03-03 14:20:47,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:47,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:47,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:20:47,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:20:47,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:47,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345863292] [2025-03-03 14:20:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345863292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970204767] [2025-03-03 14:20:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:47,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:47,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:47,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:47,843 INFO L87 Difference]: Start difference. First operand 9551 states and 16150 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:48,164 INFO L93 Difference]: Finished difference Result 24609 states and 41792 transitions. [2025-03-03 14:20:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:48,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 134 [2025-03-03 14:20:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:48,222 INFO L225 Difference]: With dead ends: 24609 [2025-03-03 14:20:48,223 INFO L226 Difference]: Without dead ends: 16735 [2025-03-03 14:20:48,257 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:20:48,258 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 100 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 955 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:20:48,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 955 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16735 states. [2025-03-03 14:20:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16735 to 16727. [2025-03-03 14:20:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16727 states, 13932 states have (on average 1.6026414010910135) internal successors, (22328), 13937 states have internal predecessors, (22328), 2771 states have call successors, (2771), 21 states have call predecessors, (2771), 23 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2025-03-03 14:20:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16727 states to 16727 states and 28209 transitions. [2025-03-03 14:20:48,917 INFO L78 Accepts]: Start accepts. Automaton has 16727 states and 28209 transitions. Word has length 134 [2025-03-03 14:20:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:48,917 INFO L471 AbstractCegarLoop]: Abstraction has 16727 states and 28209 transitions. [2025-03-03 14:20:48,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 16727 states and 28209 transitions. [2025-03-03 14:20:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:20:48,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:48,947 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:48,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:20:48,947 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:48,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:48,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1681674767, now seen corresponding path program 1 times [2025-03-03 14:20:48,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:48,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721348250] [2025-03-03 14:20:48,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:48,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:48,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:20:48,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:20:48,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:48,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:48,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:48,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721348250] [2025-03-03 14:20:48,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721348250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:48,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:48,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:48,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743964269] [2025-03-03 14:20:48,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:48,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:48,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:48,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:48,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:48,995 INFO L87 Difference]: Start difference. First operand 16727 states and 28209 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:49,691 INFO L93 Difference]: Finished difference Result 44190 states and 74870 transitions. [2025-03-03 14:20:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:49,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2025-03-03 14:20:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:49,819 INFO L225 Difference]: With dead ends: 44190 [2025-03-03 14:20:49,819 INFO L226 Difference]: Without dead ends: 29809 [2025-03-03 14:20:49,875 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:20:49,875 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 98 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 930 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:20:49,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29809 states. [2025-03-03 14:20:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29809 to 29801. [2025-03-03 14:20:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29801 states, 24967 states have (on average 1.5991108262907037) internal successors, (39925), 24972 states have internal predecessors, (39925), 4810 states have call successors, (4810), 21 states have call predecessors, (4810), 23 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-03-03 14:20:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29801 states to 29801 states and 50158 transitions. [2025-03-03 14:20:51,126 INFO L78 Accepts]: Start accepts. Automaton has 29801 states and 50158 transitions. Word has length 135 [2025-03-03 14:20:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 29801 states and 50158 transitions. [2025-03-03 14:20:51,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 29801 states and 50158 transitions. [2025-03-03 14:20:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:20:51,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:51,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:51,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:20:51,170 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:51,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2013922195, now seen corresponding path program 1 times [2025-03-03 14:20:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143797302] [2025-03-03 14:20:51,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:51,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:20:51,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:20:51,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:51,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:51,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143797302] [2025-03-03 14:20:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143797302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240755928] [2025-03-03 14:20:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:51,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:51,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:51,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:51,224 INFO L87 Difference]: Start difference. First operand 29801 states and 50158 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:52,081 INFO L93 Difference]: Finished difference Result 81147 states and 137082 transitions. [2025-03-03 14:20:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2025-03-03 14:20:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:52,302 INFO L225 Difference]: With dead ends: 81147 [2025-03-03 14:20:52,302 INFO L226 Difference]: Without dead ends: 54495 [2025-03-03 14:20:52,375 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:20:52,377 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 96 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 933 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:20:52,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 933 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54495 states. [2025-03-03 14:20:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54495 to 54487. [2025-03-03 14:20:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54487 states, 45938 states have (on average 1.594170403587444) internal successors, (73233), 45943 states have internal predecessors, (73233), 8525 states have call successors, (8525), 21 states have call predecessors, (8525), 23 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2025-03-03 14:20:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54487 states to 54487 states and 91428 transitions. [2025-03-03 14:20:54,539 INFO L78 Accepts]: Start accepts. Automaton has 54487 states and 91428 transitions. Word has length 136 [2025-03-03 14:20:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:54,540 INFO L471 AbstractCegarLoop]: Abstraction has 54487 states and 91428 transitions. [2025-03-03 14:20:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 54487 states and 91428 transitions. [2025-03-03 14:20:54,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:20:54,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:54,587 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:54,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:20:54,587 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:54,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash 800928462, now seen corresponding path program 1 times [2025-03-03 14:20:54,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:54,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049800767] [2025-03-03 14:20:54,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:54,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:20:54,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:20:54,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:54,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:54,650 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:54,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:54,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049800767] [2025-03-03 14:20:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049800767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:54,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:54,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169520760] [2025-03-03 14:20:54,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:54,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:54,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:54,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:54,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:54,653 INFO L87 Difference]: Start difference. First operand 54487 states and 91428 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:56,349 INFO L93 Difference]: Finished difference Result 101693 states and 170989 transitions. [2025-03-03 14:20:56,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:56,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 137 [2025-03-03 14:20:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:56,782 INFO L225 Difference]: With dead ends: 101693 [2025-03-03 14:20:56,782 INFO L226 Difference]: Without dead ends: 101536 [2025-03-03 14:20:56,848 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:20:56,849 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 91 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:56,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 936 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:56,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101536 states. [2025-03-03 14:20:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101536 to 101528. [2025-03-03 14:21:00,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101528 states, 86180 states have (on average 1.5877349733116732) internal successors, (136831), 86185 states have internal predecessors, (136831), 15324 states have call successors, (15324), 21 states have call predecessors, (15324), 23 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2025-03-03 14:21:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101528 states to 101528 states and 169670 transitions. [2025-03-03 14:21:00,432 INFO L78 Accepts]: Start accepts. Automaton has 101528 states and 169670 transitions. Word has length 137 [2025-03-03 14:21:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:00,433 INFO L471 AbstractCegarLoop]: Abstraction has 101528 states and 169670 transitions. [2025-03-03 14:21:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 101528 states and 169670 transitions. [2025-03-03 14:21:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 14:21:00,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:00,492 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:00,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:21:00,492 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:00,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash -998870578, now seen corresponding path program 1 times [2025-03-03 14:21:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:00,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206953815] [2025-03-03 14:21:00,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:00,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:00,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:21:00,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:21:00,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:21:00,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:00,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206953815] [2025-03-03 14:21:00,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206953815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:00,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460034234] [2025-03-03 14:21:00,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:00,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:00,793 INFO L229 MonitoredProcess]: Starting monitored process 8 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:21:00,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:21:00,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:21:01,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:21:01,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:01,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:01,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:21:01,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:21:01,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:01,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460034234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:01,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:01,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-03-03 14:21:01,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952305958] [2025-03-03 14:21:01,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:01,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:21:01,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:01,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:21:01,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:21:01,495 INFO L87 Difference]: Start difference. First operand 101528 states and 169670 transitions. Second operand has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:21:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:05,925 INFO L93 Difference]: Finished difference Result 202328 states and 343620 transitions. [2025-03-03 14:21:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:21:05,925 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 138 [2025-03-03 14:21:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:06,789 INFO L225 Difference]: With dead ends: 202328 [2025-03-03 14:21:06,789 INFO L226 Difference]: Without dead ends: 202179 [2025-03-03 14:21:07,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:21:07,078 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 772 mSDsluCounter, 4280 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 4856 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:07,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 4856 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 14:21:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202179 states. [2025-03-03 14:21:13,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202179 to 202151. [2025-03-03 14:21:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202151 states, 171653 states have (on average 1.58858278037669) internal successors, (272685), 171554 states have internal predecessors, (272685), 30441 states have call successors, (30441), 51 states have call predecessors, (30441), 56 states have return successors, (38097), 30551 states have call predecessors, (38097), 30438 states have call successors, (38097) [2025-03-03 14:21:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202151 states to 202151 states and 341223 transitions. [2025-03-03 14:21:14,434 INFO L78 Accepts]: Start accepts. Automaton has 202151 states and 341223 transitions. Word has length 138 [2025-03-03 14:21:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:14,439 INFO L471 AbstractCegarLoop]: Abstraction has 202151 states and 341223 transitions. [2025-03-03 14:21:14,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.454545454545455) internal successors, (104), 9 states have internal predecessors, (104), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:21:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 202151 states and 341223 transitions. [2025-03-03 14:21:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:21:14,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:14,588 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:14,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:21:14,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:14,789 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:14,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:14,789 INFO L85 PathProgramCache]: Analyzing trace with hash 424115972, now seen corresponding path program 1 times [2025-03-03 14:21:14,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:14,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90735684] [2025-03-03 14:21:14,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:14,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:14,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:21:14,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:21:14,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:14,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:21:14,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:14,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90735684] [2025-03-03 14:21:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90735684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:14,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:21:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676686818] [2025-03-03 14:21:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:14,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:21:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:14,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:21:14,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:21:14,897 INFO L87 Difference]: Start difference. First operand 202151 states and 341223 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)