./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_productSimulator.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 1b548755c8e9cfcfe9ed8b47fb1ac823ac6821056e7770bffa975fdbf413b243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:20:16,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:20:16,183 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:16,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:20:16,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:20:16,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:20:16,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:20:16,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:20:16,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:20:16,210 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:20:16,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:20:16,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:20:16,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:20:16,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:20:16,211 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:20:16,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:20:16,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:20:16,211 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:20:16,212 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:20:16,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:20:16,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:20:16,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:16,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:20:16,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:20:16,213 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:20:16,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:20:16,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:20:16,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:20:16,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:20:16,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:20:16,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:20:16,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:20:16,214 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 -> 1b548755c8e9cfcfe9ed8b47fb1ac823ac6821056e7770bffa975fdbf413b243 [2025-03-03 14:20:16,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:20:16,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:20:16,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:20:16,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:20:16,453 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:20:16,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c [2025-03-03 14:20:17,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf069204/85e811b740fb459a9ada28dd43026eb8/FLAG18a510fd5 [2025-03-03 14:20:17,975 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:20:17,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c [2025-03-03 14:20:18,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf069204/85e811b740fb459a9ada28dd43026eb8/FLAG18a510fd5 [2025-03-03 14:20:18,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdf069204/85e811b740fb459a9ada28dd43026eb8 [2025-03-03 14:20:18,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:20:18,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:20:18,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:20:18,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:20:18,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:20:18,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:20:18" (1/1) ... [2025-03-03 14:20:18,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61afba71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:18, skipping insertion in model container [2025-03-03 14:20:18,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:20:18" (1/1) ... [2025-03-03 14:20:18,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:20:18,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c[14867,14880] [2025-03-03 14:20:18,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:20:18,718 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:20:18,724 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-03 14:20:18,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2025-03-03 14:20:18,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [751] [2025-03-03 14:20:18,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [768] [2025-03-03 14:20:18,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [777] [2025-03-03 14:20:18,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1848] [2025-03-03 14:20:18,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2247] [2025-03-03 14:20:18,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2608] [2025-03-03 14:20:18,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2874] [2025-03-03 14:20:18,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2893] [2025-03-03 14:20:18,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3097] [2025-03-03 14:20:18,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c[14867,14880] [2025-03-03 14:20:18,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:20:18,861 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:20:18,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:18 WrapperNode [2025-03-03 14:20:18,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:20:18,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:20:18,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:20:18,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:20:18,868 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:18" (1/1) ... [2025-03-03 14:20:18,888 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:18" (1/1) ... [2025-03-03 14:20:18,933 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1305 [2025-03-03 14:20:18,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:20:18,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:20:18,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:20:18,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:20:18,941 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:18" (1/1) ... [2025-03-03 14:20:18,942 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:18" (1/1) ... [2025-03-03 14:20:18,949 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:18" (1/1) ... [2025-03-03 14:20:18,977 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:18,978 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:18" (1/1) ... [2025-03-03 14:20:18,978 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:18" (1/1) ... [2025-03-03 14:20:19,001 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:18" (1/1) ... [2025-03-03 14:20:19,007 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:18" (1/1) ... [2025-03-03 14:20:19,011 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:18" (1/1) ... [2025-03-03 14:20:19,018 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:18" (1/1) ... [2025-03-03 14:20:19,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:20:19,034 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:20:19,034 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:20:19,034 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:20:19,035 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:18" (1/1) ... [2025-03-03 14:20:19,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:19,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:19,062 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:19,066 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:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:20:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:20:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-03 14:20:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-03 14:20:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-03 14:20:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-03 14:20:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:20:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:20:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:20:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:20:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:20:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:20:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:20:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:20:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:20:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:20:19,087 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:20:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-03 14:20:19,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-03 14:20:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-03 14:20:19,090 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-03 14:20:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:20:19,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:20:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:20:19,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:20:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:20:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:20:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:20:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:20:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:20:19,091 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:20:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-03 14:20:19,092 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-03 14:20:19,092 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-03 14:20:19,092 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-03 14:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:20:19,093 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:20:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:20:19,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:20:19,274 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:20:19,277 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:20:19,302 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032: #res := ~retValue_acc~37; [2025-03-03 14:20:19,310 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: #res := ~retValue_acc~33; [2025-03-03 14:20:19,321 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L632: #res := ~retValue_acc~6; [2025-03-03 14:20:19,329 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1390: #res := ~retValue_acc~17; [2025-03-03 14:20:19,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: #res := ~retValue_acc~11; [2025-03-03 14:20:19,403 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1891-1: getEmailId_#res#1 := getEmailId_~retValue_acc~26#1; [2025-03-03 14:20:19,439 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2117: #res := ~retValue_acc~32; [2025-03-03 14:20:19,464 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: #res := ~retValue_acc~28; [2025-03-03 14:20:19,523 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3070: #res#1 := ~retValue_acc~39#1; [2025-03-03 14:20:19,523 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3052-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~38#1; [2025-03-03 14:20:19,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1437-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~18#1; [2025-03-03 14:20:19,609 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1482: #res#1 := ~retValue_acc~19#1; [2025-03-03 14:20:19,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1706: #res := ~retValue_acc~22; [2025-03-03 14:20:19,659 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094-1: createEmail_#res#1 := createEmail_~retValue_acc~41#1; [2025-03-03 14:20:19,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2080: #res := ~retValue_acc~31; [2025-03-03 14:20:19,696 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: getClientId_#res#1 := getClientId_~retValue_acc~24#1; [2025-03-03 14:20:19,735 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228-1: isVerified_#res#1 := isVerified_~retValue_acc~35#1; [2025-03-03 14:20:19,736 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~23#1; [2025-03-03 14:20:19,741 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191: #res := ~retValue_acc~34; [2025-03-03 14:20:19,778 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: #res := ~retValue_acc~0; [2025-03-03 14:20:19,795 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: #res := ~retValue_acc~15; [2025-03-03 14:20:19,822 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1343-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~16#1; [2025-03-03 14:20:20,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L598-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~4#1; [2025-03-03 14:20:20,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1545-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~20#1; [2025-03-03 14:20:20,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L589-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~3#1; [2025-03-03 14:20:20,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L607-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~5#1; [2025-03-03 14:20:20,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L165-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-03 14:20:20,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1652-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~21#1; [2025-03-03 14:20:20,077 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: #res := ~retValue_acc~27; [2025-03-03 14:20:20,260 INFO L? ?]: Removed 623 outVars from TransFormulas that were not future-live. [2025-03-03 14:20:20,260 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:20:20,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:20:20,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:20:20,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:20:20 BoogieIcfgContainer [2025-03-03 14:20:20,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:20:20,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:20:20,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:20:20,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:20:20,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:20:18" (1/3) ... [2025-03-03 14:20:20,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680b9124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:20:20, skipping insertion in model container [2025-03-03 14:20:20,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:18" (2/3) ... [2025-03-03 14:20:20,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680b9124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:20:20, skipping insertion in model container [2025-03-03 14:20:20,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:20:20" (3/3) ... [2025-03-03 14:20:20,292 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_productSimulator.cil.c [2025-03-03 14:20:20,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:20:20,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_productSimulator.cil.c that has 44 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:20:20,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:20:20,377 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;@5028760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:20:20,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:20:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-03 14:20:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 14:20:20,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:20,406 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash 750529619, now seen corresponding path program 1 times [2025-03-03 14:20:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400271984] [2025-03-03 14:20:20,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:20,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:20:20,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:20:20,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:20,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 14:20:20,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400271984] [2025-03-03 14:20:20,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400271984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:20,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:20:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201158882] [2025-03-03 14:20:20,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:20,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:20:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:20,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:20:20,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:20:20,777 INFO L87 Difference]: Start difference. First operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:20:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:20,845 INFO L93 Difference]: Finished difference Result 930 states and 1369 transitions. [2025-03-03 14:20:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:20:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 177 [2025-03-03 14:20:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:20,857 INFO L225 Difference]: With dead ends: 930 [2025-03-03 14:20:20,857 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 14:20:20,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:20:20,867 INFO L435 NwaCegarLoop]: 889 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, 889 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:20,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 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:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 14:20:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-03 14:20:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.5125284738041003) internal successors, (664), 458 states have internal predecessors, (664), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 14:20:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 881 transitions. [2025-03-03 14:20:20,965 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 881 transitions. Word has length 177 [2025-03-03 14:20:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:20,967 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 881 transitions. [2025-03-03 14:20:20,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:20:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 881 transitions. [2025-03-03 14:20:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:20:20,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:20,974 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:20:20,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:20,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash -418618770, now seen corresponding path program 1 times [2025-03-03 14:20:20,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:20,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610510548] [2025-03-03 14:20:20,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:20,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:21,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:20:21,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:20:21,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:21,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 14:20:21,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:21,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610510548] [2025-03-03 14:20:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610510548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:21,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:21,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:21,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875340401] [2025-03-03 14:20:21,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:21,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:21,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:21,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:21,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:21,284 INFO L87 Difference]: Start difference. First operand 592 states and 881 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:20:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:21,376 INFO L93 Difference]: Finished difference Result 1148 states and 1706 transitions. [2025-03-03 14:20:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 165 [2025-03-03 14:20:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:21,381 INFO L225 Difference]: With dead ends: 1148 [2025-03-03 14:20:21,382 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 14:20:21,384 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:21,384 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 0 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:21,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 14:20:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-03 14:20:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.4965831435079726) internal successors, (657), 458 states have internal predecessors, (657), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 14:20:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-03-03 14:20:21,443 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 165 [2025-03-03 14:20:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:21,443 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-03-03 14:20:21,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:20:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-03-03 14:20:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 14:20:21,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:21,449 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:20:21,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:21,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:21,450 INFO L85 PathProgramCache]: Analyzing trace with hash 495196208, now seen corresponding path program 1 times [2025-03-03 14:20:21,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:21,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109654433] [2025-03-03 14:20:21,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:21,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:21,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:20:21,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:20:21,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:21,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-03 14:20:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:21,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109654433] [2025-03-03 14:20:21,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109654433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:21,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838515906] [2025-03-03 14:20:21,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:21,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:21,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:21,748 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:21,750 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:21,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:20:22,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:20:22,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:22,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:22,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:20:22,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 14:20:22,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:22,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838515906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:22,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:22,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 14:20:22,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137316914] [2025-03-03 14:20:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:22,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:22,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:22,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:22,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:22,145 INFO L87 Difference]: Start difference. First operand 592 states and 874 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:20:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:22,183 INFO L93 Difference]: Finished difference Result 919 states and 1331 transitions. [2025-03-03 14:20:22,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:22,184 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 170 [2025-03-03 14:20:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:22,187 INFO L225 Difference]: With dead ends: 919 [2025-03-03 14:20:22,187 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 14:20:22,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:22,189 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 0 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1744 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:22,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1744 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:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 14:20:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-03 14:20:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 441 states have (on average 1.4943310657596371) internal successors, (659), 460 states have internal predecessors, (659), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 14:20:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2025-03-03 14:20:22,208 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 170 [2025-03-03 14:20:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:22,209 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2025-03-03 14:20:22,209 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:20:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2025-03-03 14:20:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 14:20:22,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:22,214 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,224 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:22,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:22,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:22,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1341176448, now seen corresponding path program 1 times [2025-03-03 14:20:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:22,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689810816] [2025-03-03 14:20:22,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:22,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:22,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 14:20:22,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 14:20:22,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:22,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 14:20:22,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:22,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689810816] [2025-03-03 14:20:22,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689810816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:22,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101053557] [2025-03-03 14:20:22,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:22,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:22,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:22,726 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:22,728 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:22,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 14:20:23,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 14:20:23,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:23,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:23,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:23,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 14:20:23,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:23,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101053557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:23,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:23,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 14:20:23,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171188625] [2025-03-03 14:20:23,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:23,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:23,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:23,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:23,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:23,214 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:20:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:23,272 INFO L93 Difference]: Finished difference Result 1446 states and 2142 transitions. [2025-03-03 14:20:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:23,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 189 [2025-03-03 14:20:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:23,279 INFO L225 Difference]: With dead ends: 1446 [2025-03-03 14:20:23,279 INFO L226 Difference]: Without dead ends: 1129 [2025-03-03 14:20:23,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:23,283 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 740 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:23,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1750 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-03-03 14:20:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1127. [2025-03-03 14:20:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 840 states have (on average 1.5011904761904762) internal successors, (1261), 874 states have internal predecessors, (1261), 200 states have call successors, (200), 86 states have call predecessors, (200), 86 states have return successors, (211), 197 states have call predecessors, (211), 198 states have call successors, (211) [2025-03-03 14:20:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1672 transitions. [2025-03-03 14:20:23,343 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1672 transitions. Word has length 189 [2025-03-03 14:20:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:23,344 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1672 transitions. [2025-03-03 14:20:23,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:20:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1672 transitions. [2025-03-03 14:20:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 14:20:23,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:23,349 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,357 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:23,553 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,SelfDestructingSolverStorable3 [2025-03-03 14:20:23,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2029223270, now seen corresponding path program 1 times [2025-03-03 14:20:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:23,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742206344] [2025-03-03 14:20:23,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:23,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 14:20:23,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:20:23,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:23,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:20:23,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:23,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742206344] [2025-03-03 14:20:23,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742206344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:23,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106926781] [2025-03-03 14:20:23,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:23,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:23,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:23,779 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:23,781 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:23,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 14:20:24,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:20:24,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:24,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:24,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 1434 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:20:24,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:20:24,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106926781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-03-03 14:20:24,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865947733] [2025-03-03 14:20:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:24,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:20:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:24,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:20:24,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:20:24,148 INFO L87 Difference]: Start difference. First operand 1127 states and 1672 transitions. Second operand has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:20:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:24,245 INFO L93 Difference]: Finished difference Result 2178 states and 3245 transitions. [2025-03-03 14:20:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:20:24,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 176 [2025-03-03 14:20:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:24,252 INFO L225 Difference]: With dead ends: 2178 [2025-03-03 14:20:24,252 INFO L226 Difference]: Without dead ends: 1137 [2025-03-03 14:20:24,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:20:24,256 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:24,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-03 14:20:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1135. [2025-03-03 14:20:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 844 states have (on average 1.4988151658767772) internal successors, (1265), 880 states have internal predecessors, (1265), 200 states have call successors, (200), 86 states have call predecessors, (200), 90 states have return successors, (219), 199 states have call predecessors, (219), 198 states have call successors, (219) [2025-03-03 14:20:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1684 transitions. [2025-03-03 14:20:24,295 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1684 transitions. Word has length 176 [2025-03-03 14:20:24,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:24,295 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1684 transitions. [2025-03-03 14:20:24,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:20:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1684 transitions. [2025-03-03 14:20:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 14:20:24,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:24,299 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 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:24,308 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:24,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:24,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1224462049, now seen corresponding path program 1 times [2025-03-03 14:20:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:24,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355086034] [2025-03-03 14:20:24,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:24,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:24,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:20:24,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:20:24,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:24,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:20:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355086034] [2025-03-03 14:20:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355086034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:24,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:24,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:20:24,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223354864] [2025-03-03 14:20:24,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:24,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:20:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:24,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:20:24,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:24,698 INFO L87 Difference]: Start difference. First operand 1135 states and 1684 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:20:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:24,797 INFO L93 Difference]: Finished difference Result 2150 states and 3205 transitions. [2025-03-03 14:20:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:20:24,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 177 [2025-03-03 14:20:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:24,806 INFO L225 Difference]: With dead ends: 2150 [2025-03-03 14:20:24,806 INFO L226 Difference]: Without dead ends: 1141 [2025-03-03 14:20:24,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:24,809 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:24,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-03 14:20:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1139. [2025-03-03 14:20:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 846 states have (on average 1.4976359338061467) internal successors, (1267), 882 states have internal predecessors, (1267), 200 states have call successors, (200), 86 states have call predecessors, (200), 92 states have return successors, (221), 201 states have call predecessors, (221), 198 states have call successors, (221) [2025-03-03 14:20:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1688 transitions. [2025-03-03 14:20:24,844 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1688 transitions. Word has length 177 [2025-03-03 14:20:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:24,844 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1688 transitions. [2025-03-03 14:20:24,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:20:24,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1688 transitions. [2025-03-03 14:20:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-03 14:20:24,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:24,848 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:20:24,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:24,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1003095168, now seen corresponding path program 2 times [2025-03-03 14:20:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79006797] [2025-03-03 14:20:24,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:20:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:24,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 178 statements into 2 equivalence classes. [2025-03-03 14:20:24,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 89 of 178 statements. [2025-03-03 14:20:24,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:20:24,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 14:20:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79006797] [2025-03-03 14:20:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79006797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:24,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:24,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:20:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959812531] [2025-03-03 14:20:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:20:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:24,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:20:24,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:24,985 INFO L87 Difference]: Start difference. First operand 1139 states and 1688 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 14:20:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:25,040 INFO L93 Difference]: Finished difference Result 1149 states and 1702 transitions. [2025-03-03 14:20:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:20:25,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-03-03 14:20:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:25,047 INFO L225 Difference]: With dead ends: 1149 [2025-03-03 14:20:25,047 INFO L226 Difference]: Without dead ends: 1147 [2025-03-03 14:20:25,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:25,048 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 0 mSDsluCounter, 4346 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5217 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:25,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5217 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-03-03 14:20:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2025-03-03 14:20:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 852 states have (on average 1.494131455399061) internal successors, (1273), 888 states have internal predecessors, (1273), 200 states have call successors, (200), 86 states have call predecessors, (200), 94 states have return successors, (226), 203 states have call predecessors, (226), 198 states have call successors, (226) [2025-03-03 14:20:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1699 transitions. [2025-03-03 14:20:25,091 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1699 transitions. Word has length 178 [2025-03-03 14:20:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:25,092 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1699 transitions. [2025-03-03 14:20:25,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 14:20:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1699 transitions. [2025-03-03 14:20:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 14:20:25,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:25,097 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:20:25,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:25,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:25,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1404853778, now seen corresponding path program 1 times [2025-03-03 14:20:25,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:25,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086659690] [2025-03-03 14:20:25,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:25,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 14:20:25,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 14:20:25,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:25,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:20:25,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:25,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086659690] [2025-03-03 14:20:25,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086659690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:25,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:20:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46788316] [2025-03-03 14:20:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:25,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:20:25,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:25,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:20:25,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:25,261 INFO L87 Difference]: Start difference. First operand 1147 states and 1699 transitions. Second operand has 7 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:20:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:25,367 INFO L93 Difference]: Finished difference Result 2174 states and 3239 transitions. [2025-03-03 14:20:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:20:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181 [2025-03-03 14:20:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:25,374 INFO L225 Difference]: With dead ends: 2174 [2025-03-03 14:20:25,374 INFO L226 Difference]: Without dead ends: 1157 [2025-03-03 14:20:25,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:25,377 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 2 mSDsluCounter, 4312 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:25,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2025-03-03 14:20:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1151. [2025-03-03 14:20:25,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 854 states have (on average 1.4929742388758782) internal successors, (1275), 892 states have internal predecessors, (1275), 200 states have call successors, (200), 86 states have call predecessors, (200), 96 states have return successors, (232), 203 states have call predecessors, (232), 198 states have call successors, (232) [2025-03-03 14:20:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1707 transitions. [2025-03-03 14:20:25,419 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1707 transitions. Word has length 181 [2025-03-03 14:20:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:25,419 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1707 transitions. [2025-03-03 14:20:25,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:20:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1707 transitions. [2025-03-03 14:20:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 14:20:25,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:25,423 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:20:25,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash 443708816, now seen corresponding path program 1 times [2025-03-03 14:20:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129137774] [2025-03-03 14:20:25,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:25,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 14:20:25,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 14:20:25,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:25,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-03 14:20:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:25,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129137774] [2025-03-03 14:20:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129137774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363793808] [2025-03-03 14:20:25,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:25,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:25,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:25,557 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:25,558 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:25,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 14:20:25,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 14:20:25,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:25,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:25,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:25,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 14:20:25,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363793808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 14:20:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217874202] [2025-03-03 14:20:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:25,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:25,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:25,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:25,996 INFO L87 Difference]: Start difference. First operand 1151 states and 1707 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:20:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:26,107 INFO L93 Difference]: Finished difference Result 3329 states and 5078 transitions. [2025-03-03 14:20:26,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 182 [2025-03-03 14:20:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:26,115 INFO L225 Difference]: With dead ends: 3329 [2025-03-03 14:20:26,116 INFO L226 Difference]: Without dead ends: 1138 [2025-03-03 14:20:26,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:26,122 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 724 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:26,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1768 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:26,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-03-03 14:20:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2025-03-03 14:20:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 848 states have (on average 1.4870283018867925) internal successors, (1261), 882 states have internal predecessors, (1261), 194 states have call successors, (194), 87 states have call predecessors, (194), 95 states have return successors, (220), 195 states have call predecessors, (220), 192 states have call successors, (220) [2025-03-03 14:20:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1675 transitions. [2025-03-03 14:20:26,162 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1675 transitions. Word has length 182 [2025-03-03 14:20:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:26,162 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1675 transitions. [2025-03-03 14:20:26,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:20:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1675 transitions. [2025-03-03 14:20:26,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 14:20:26,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:26,169 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,178 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:26,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:26,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:26,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1923631292, now seen corresponding path program 1 times [2025-03-03 14:20:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:26,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156552146] [2025-03-03 14:20:26,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:26,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 14:20:26,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 14:20:26,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:26,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 14:20:26,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:26,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156552146] [2025-03-03 14:20:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156552146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:26,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294464059] [2025-03-03 14:20:26,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:26,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:26,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:26,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:26,437 INFO L87 Difference]: Start difference. First operand 1138 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:20:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:26,480 INFO L93 Difference]: Finished difference Result 2241 states and 3333 transitions. [2025-03-03 14:20:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:26,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 198 [2025-03-03 14:20:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:26,488 INFO L225 Difference]: With dead ends: 2241 [2025-03-03 14:20:26,488 INFO L226 Difference]: Without dead ends: 1136 [2025-03-03 14:20:26,492 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:26,492 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 826 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:26,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 885 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-03-03 14:20:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1136. [2025-03-03 14:20:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 848 states have (on average 1.4834905660377358) internal successors, (1258), 880 states have internal predecessors, (1258), 192 states have call successors, (192), 87 states have call predecessors, (192), 95 states have return successors, (217), 193 states have call predecessors, (217), 190 states have call successors, (217) [2025-03-03 14:20:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1667 transitions. [2025-03-03 14:20:26,531 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1667 transitions. Word has length 198 [2025-03-03 14:20:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:26,532 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1667 transitions. [2025-03-03 14:20:26,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:20:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1667 transitions. [2025-03-03 14:20:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 14:20:26,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:26,536 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:20:26,536 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:26,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:26,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1925105569, now seen corresponding path program 1 times [2025-03-03 14:20:26,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:26,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247076997] [2025-03-03 14:20:26,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:26,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:20:26,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:20:26,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:26,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 14:20:26,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:26,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247076997] [2025-03-03 14:20:26,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247076997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:26,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508729560] [2025-03-03 14:20:26,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:26,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:26,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:26,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:26,603 INFO L87 Difference]: Start difference. First operand 1136 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:20:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:26,678 INFO L93 Difference]: Finished difference Result 2207 states and 3248 transitions. [2025-03-03 14:20:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:26,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 206 [2025-03-03 14:20:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:26,689 INFO L225 Difference]: With dead ends: 2207 [2025-03-03 14:20:26,689 INFO L226 Difference]: Without dead ends: 1130 [2025-03-03 14:20:26,692 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:26,694 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 798 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:26,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 862 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-03-03 14:20:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1114. [2025-03-03 14:20:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 840 states have (on average 1.4619047619047618) internal successors, (1228), 858 states have internal predecessors, (1228), 186 states have call successors, (186), 87 states have call predecessors, (186), 87 states have return successors, (195), 183 states have call predecessors, (195), 184 states have call successors, (195) [2025-03-03 14:20:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1609 transitions. [2025-03-03 14:20:26,737 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1609 transitions. Word has length 206 [2025-03-03 14:20:26,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:26,737 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1609 transitions. [2025-03-03 14:20:26,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:20:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1609 transitions. [2025-03-03 14:20:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 14:20:26,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:26,742 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:20:26,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:26,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:26,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1305979296, now seen corresponding path program 1 times [2025-03-03 14:20:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260418870] [2025-03-03 14:20:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:26,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:26,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 14:20:26,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 14:20:26,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:26,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 14:20:26,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:26,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260418870] [2025-03-03 14:20:26,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260418870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:26,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762285839] [2025-03-03 14:20:26,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:26,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:26,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:26,965 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:26,966 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:27,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 14:20:27,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 14:20:27,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:27,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:27,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:27,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 14:20:27,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762285839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:27,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:27,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:20:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786516477] [2025-03-03 14:20:27,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:27,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:27,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:27,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:20:27,356 INFO L87 Difference]: Start difference. First operand 1114 states and 1609 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:27,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:27,407 INFO L93 Difference]: Finished difference Result 2299 states and 3381 transitions. [2025-03-03 14:20:27,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:27,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 222 [2025-03-03 14:20:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:27,414 INFO L225 Difference]: With dead ends: 2299 [2025-03-03 14:20:27,415 INFO L226 Difference]: Without dead ends: 1308 [2025-03-03 14:20:27,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:20:27,418 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 165 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1652 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:27,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1652 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:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-03-03 14:20:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1292. [2025-03-03 14:20:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 990 states have (on average 1.4767676767676767) internal successors, (1462), 1008 states have internal predecessors, (1462), 214 states have call successors, (214), 87 states have call predecessors, (214), 87 states have return successors, (223), 211 states have call predecessors, (223), 212 states have call successors, (223) [2025-03-03 14:20:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1899 transitions. [2025-03-03 14:20:27,463 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1899 transitions. Word has length 222 [2025-03-03 14:20:27,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:27,463 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1899 transitions. [2025-03-03 14:20:27,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1899 transitions. [2025-03-03 14:20:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 14:20:27,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:27,468 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:20:27,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:20:27,669 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1971864472, now seen corresponding path program 1 times [2025-03-03 14:20:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511823597] [2025-03-03 14:20:27,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 14:20:27,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 14:20:27,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:27,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 14:20:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511823597] [2025-03-03 14:20:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511823597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404993798] [2025-03-03 14:20:27,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:27,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:27,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:27,863 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:27,864 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:28,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 14:20:28,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 14:20:28,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:28,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:28,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:20:28,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-03 14:20:28,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404993798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:28,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:28,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 14:20:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228418273] [2025-03-03 14:20:28,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:28,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:28,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:28,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:28,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:20:28,263 INFO L87 Difference]: Start difference. First operand 1292 states and 1899 transitions. Second operand has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 14:20:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:28,358 INFO L93 Difference]: Finished difference Result 2511 states and 3714 transitions. [2025-03-03 14:20:28,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:20:28,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 230 [2025-03-03 14:20:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:28,366 INFO L225 Difference]: With dead ends: 2511 [2025-03-03 14:20:28,366 INFO L226 Difference]: Without dead ends: 1296 [2025-03-03 14:20:28,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:20:28,370 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 4 mSDsluCounter, 4963 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5793 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:28,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5793 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-03-03 14:20:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2025-03-03 14:20:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 992 states have (on average 1.4758064516129032) internal successors, (1464), 1012 states have internal predecessors, (1464), 214 states have call successors, (214), 87 states have call predecessors, (214), 89 states have return successors, (227), 211 states have call predecessors, (227), 212 states have call successors, (227) [2025-03-03 14:20:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1905 transitions. [2025-03-03 14:20:28,417 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1905 transitions. Word has length 230 [2025-03-03 14:20:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:28,417 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1905 transitions. [2025-03-03 14:20:28,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 14:20:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1905 transitions. [2025-03-03 14:20:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 14:20:28,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:28,423 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,432 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:28,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:28,624 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:28,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2042491132, now seen corresponding path program 1 times [2025-03-03 14:20:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002447416] [2025-03-03 14:20:28,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:28,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 14:20:28,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 14:20:28,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:28,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:28,766 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 14:20:28,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:28,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002447416] [2025-03-03 14:20:28,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002447416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:28,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153079491] [2025-03-03 14:20:28,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:28,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:28,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:28,768 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:20:28,770 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:20:28,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 14:20:29,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 14:20:29,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:29,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:29,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:20:29,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-03 14:20:29,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153079491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:29,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:29,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 14:20:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485301806] [2025-03-03 14:20:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:29,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:20:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:29,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:20:29,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:20:29,141 INFO L87 Difference]: Start difference. First operand 1296 states and 1905 transitions. Second operand has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-03 14:20:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:29,221 INFO L93 Difference]: Finished difference Result 2513 states and 3722 transitions. [2025-03-03 14:20:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:20:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 224 [2025-03-03 14:20:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:29,229 INFO L225 Difference]: With dead ends: 2513 [2025-03-03 14:20:29,230 INFO L226 Difference]: Without dead ends: 1300 [2025-03-03 14:20:29,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:20:29,233 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 2 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:29,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4133 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-03-03 14:20:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-03-03 14:20:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 994 states have (on average 1.4748490945674044) internal successors, (1466), 1016 states have internal predecessors, (1466), 214 states have call successors, (214), 87 states have call predecessors, (214), 91 states have return successors, (237), 211 states have call predecessors, (237), 212 states have call successors, (237) [2025-03-03 14:20:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1917 transitions. [2025-03-03 14:20:29,278 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1917 transitions. Word has length 224 [2025-03-03 14:20:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:29,279 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1917 transitions. [2025-03-03 14:20:29,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-03-03 14:20:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1917 transitions. [2025-03-03 14:20:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 14:20:29,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:29,283 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:20:29,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:29,485 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:29,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:29,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1430451450, now seen corresponding path program 1 times [2025-03-03 14:20:29,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:29,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846146222] [2025-03-03 14:20:29,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:29,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 14:20:29,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 14:20:29,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:29,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 14:20:29,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:29,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846146222] [2025-03-03 14:20:29,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846146222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:29,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:29,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346274539] [2025-03-03 14:20:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:29,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:29,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:29,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:29,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:29,669 INFO L87 Difference]: Start difference. First operand 1300 states and 1917 transitions. Second operand has 8 states, 6 states have (on average 22.333333333333332) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 14:20:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:29,752 INFO L93 Difference]: Finished difference Result 2489 states and 3696 transitions. [2025-03-03 14:20:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:20:29,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.333333333333332) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 232 [2025-03-03 14:20:29,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:29,764 INFO L225 Difference]: With dead ends: 2489 [2025-03-03 14:20:29,764 INFO L226 Difference]: Without dead ends: 1300 [2025-03-03 14:20:29,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:20:29,768 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 4 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5800 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:29,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5800 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-03-03 14:20:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-03-03 14:20:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 994 states have (on average 1.4748490945674044) internal successors, (1466), 1016 states have internal predecessors, (1466), 214 states have call successors, (214), 87 states have call predecessors, (214), 91 states have return successors, (235), 211 states have call predecessors, (235), 212 states have call successors, (235) [2025-03-03 14:20:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1915 transitions. [2025-03-03 14:20:29,806 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1915 transitions. Word has length 232 [2025-03-03 14:20:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:29,806 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1915 transitions. [2025-03-03 14:20:29,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.333333333333332) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 14:20:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1915 transitions. [2025-03-03 14:20:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 14:20:29,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:29,811 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:20:29,811 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:29,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1371488628, now seen corresponding path program 1 times [2025-03-03 14:20:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045472428] [2025-03-03 14:20:29,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:29,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 14:20:29,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 14:20:29,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:29,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 14:20:30,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045472428] [2025-03-03 14:20:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045472428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:30,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688025630] [2025-03-03 14:20:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:30,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:30,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:30,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:30,025 INFO L87 Difference]: Start difference. First operand 1300 states and 1915 transitions. Second operand has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-03 14:20:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:30,112 INFO L93 Difference]: Finished difference Result 2493 states and 3702 transitions. [2025-03-03 14:20:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:20:30,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 226 [2025-03-03 14:20:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:30,120 INFO L225 Difference]: With dead ends: 2493 [2025-03-03 14:20:30,120 INFO L226 Difference]: Without dead ends: 1304 [2025-03-03 14:20:30,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:20:30,125 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 3 mSDsluCounter, 4974 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5806 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:30,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5806 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-03-03 14:20:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-03-03 14:20:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 996 states have (on average 1.4738955823293172) internal successors, (1468), 1020 states have internal predecessors, (1468), 214 states have call successors, (214), 87 states have call predecessors, (214), 93 states have return successors, (239), 211 states have call predecessors, (239), 212 states have call successors, (239) [2025-03-03 14:20:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1921 transitions. [2025-03-03 14:20:30,167 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1921 transitions. Word has length 226 [2025-03-03 14:20:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:30,168 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1921 transitions. [2025-03-03 14:20:30,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-03 14:20:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1921 transitions. [2025-03-03 14:20:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 14:20:30,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:30,172 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:20:30,173 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:30,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash 232191543, now seen corresponding path program 1 times [2025-03-03 14:20:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:30,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154243222] [2025-03-03 14:20:30,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:30,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:30,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 14:20:30,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 14:20:30,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:30,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 14:20:30,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:30,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154243222] [2025-03-03 14:20:30,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154243222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:30,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:30,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:20:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715021102] [2025-03-03 14:20:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:30,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:20:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:30,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:20:30,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:20:30,340 INFO L87 Difference]: Start difference. First operand 1304 states and 1921 transitions. Second operand has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 14:20:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:30,460 INFO L93 Difference]: Finished difference Result 2487 states and 3690 transitions. [2025-03-03 14:20:30,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:20:30,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 234 [2025-03-03 14:20:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:30,467 INFO L225 Difference]: With dead ends: 2487 [2025-03-03 14:20:30,467 INFO L226 Difference]: Without dead ends: 1304 [2025-03-03 14:20:30,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:30,471 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 7 mSDsluCounter, 5738 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6562 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:30,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6562 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-03-03 14:20:30,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-03-03 14:20:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 996 states have (on average 1.4738955823293172) internal successors, (1468), 1020 states have internal predecessors, (1468), 214 states have call successors, (214), 87 states have call predecessors, (214), 93 states have return successors, (237), 211 states have call predecessors, (237), 212 states have call successors, (237) [2025-03-03 14:20:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1919 transitions. [2025-03-03 14:20:30,513 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1919 transitions. Word has length 234 [2025-03-03 14:20:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:30,513 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1919 transitions. [2025-03-03 14:20:30,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 14:20:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1919 transitions. [2025-03-03 14:20:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 14:20:30,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:30,518 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:20:30,518 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:30,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:30,518 INFO L85 PathProgramCache]: Analyzing trace with hash 816702396, now seen corresponding path program 2 times [2025-03-03 14:20:30,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:30,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040382486] [2025-03-03 14:20:30,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:20:30,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:30,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 235 statements into 2 equivalence classes. [2025-03-03 14:20:30,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 110 of 235 statements. [2025-03-03 14:20:30,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:20:30,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:30,601 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 14:20:30,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:30,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040382486] [2025-03-03 14:20:30,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040382486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:30,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:30,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:30,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051414137] [2025-03-03 14:20:30,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:30,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:30,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:30,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:30,602 INFO L87 Difference]: Start difference. First operand 1304 states and 1919 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-03 14:20:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:30,676 INFO L93 Difference]: Finished difference Result 3078 states and 4573 transitions. [2025-03-03 14:20:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:20:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 235 [2025-03-03 14:20:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:30,687 INFO L225 Difference]: With dead ends: 3078 [2025-03-03 14:20:30,687 INFO L226 Difference]: Without dead ends: 2485 [2025-03-03 14:20:30,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:30,690 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 740 mSDsluCounter, 2427 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:30,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3270 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-03 14:20:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2479. [2025-03-03 14:20:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 1907 states have (on average 1.4897745149449397) internal successors, (2841), 1949 states have internal predecessors, (2841), 402 states have call successors, (402), 163 states have call predecessors, (402), 169 states have return successors, (434), 396 states have call predecessors, (434), 398 states have call successors, (434) [2025-03-03 14:20:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3677 transitions. [2025-03-03 14:20:30,783 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3677 transitions. Word has length 235 [2025-03-03 14:20:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:30,784 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 3677 transitions. [2025-03-03 14:20:30,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-03-03 14:20:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3677 transitions. [2025-03-03 14:20:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 14:20:30,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:30,790 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:20:30,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1851455372, now seen corresponding path program 1 times [2025-03-03 14:20:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:30,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067601854] [2025-03-03 14:20:30,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:30,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:30,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 14:20:30,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 14:20:30,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:30,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 14:20:30,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:30,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067601854] [2025-03-03 14:20:30,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067601854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:30,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:20:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258743726] [2025-03-03 14:20:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:30,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:20:30,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:30,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:20:30,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:20:30,922 INFO L87 Difference]: Start difference. First operand 2479 states and 3677 transitions. Second operand has 9 states, 7 states have (on average 20.142857142857142) internal successors, (141), 8 states have internal predecessors, (141), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 14:20:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:31,065 INFO L93 Difference]: Finished difference Result 4845 states and 7226 transitions. [2025-03-03 14:20:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:20:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 20.142857142857142) internal successors, (141), 8 states have internal predecessors, (141), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 236 [2025-03-03 14:20:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:31,076 INFO L225 Difference]: With dead ends: 4845 [2025-03-03 14:20:31,077 INFO L226 Difference]: Without dead ends: 2487 [2025-03-03 14:20:31,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:31,082 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 4 mSDsluCounter, 5752 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6578 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:31,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6578 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2025-03-03 14:20:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2483. [2025-03-03 14:20:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 1909 states have (on average 1.4892613933996857) internal successors, (2843), 1953 states have internal predecessors, (2843), 402 states have call successors, (402), 163 states have call predecessors, (402), 171 states have return successors, (444), 396 states have call predecessors, (444), 398 states have call successors, (444) [2025-03-03 14:20:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3689 transitions. [2025-03-03 14:20:31,183 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3689 transitions. Word has length 236 [2025-03-03 14:20:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:31,183 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3689 transitions. [2025-03-03 14:20:31,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 20.142857142857142) internal successors, (141), 8 states have internal predecessors, (141), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-03-03 14:20:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3689 transitions. [2025-03-03 14:20:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 14:20:31,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:31,190 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:20:31,191 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:31,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash 187020003, now seen corresponding path program 1 times [2025-03-03 14:20:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372212501] [2025-03-03 14:20:31,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:31,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 14:20:31,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 14:20:31,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:31,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:31,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372212501] [2025-03-03 14:20:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372212501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058569672] [2025-03-03 14:20:31,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:31,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:31,275 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:20:31,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 14:20:31,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 14:20:31,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:31,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:31,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:31,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:31,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:20:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058569672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:20:31,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:20:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:20:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016047473] [2025-03-03 14:20:31,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:20:31,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:20:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:31,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:20:31,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:31,741 INFO L87 Difference]: Start difference. First operand 2483 states and 3689 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 14:20:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:31,915 INFO L93 Difference]: Finished difference Result 5525 states and 8363 transitions. [2025-03-03 14:20:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:20:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 230 [2025-03-03 14:20:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:31,947 INFO L225 Difference]: With dead ends: 5525 [2025-03-03 14:20:31,947 INFO L226 Difference]: Without dead ends: 4301 [2025-03-03 14:20:31,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:31,955 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 793 mSDsluCounter, 2847 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 3709 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:31,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 3709 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2025-03-03 14:20:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4221. [2025-03-03 14:20:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3393 states have (on average 1.5263778367226644) internal successors, (5179), 3437 states have internal predecessors, (5179), 656 states have call successors, (656), 163 states have call predecessors, (656), 171 states have return successors, (718), 650 states have call predecessors, (718), 652 states have call successors, (718) [2025-03-03 14:20:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 6553 transitions. [2025-03-03 14:20:32,130 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 6553 transitions. Word has length 230 [2025-03-03 14:20:32,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:32,130 INFO L471 AbstractCegarLoop]: Abstraction has 4221 states and 6553 transitions. [2025-03-03 14:20:32,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-03 14:20:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 6553 transitions. [2025-03-03 14:20:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-03 14:20:32,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:32,145 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:20:32,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:32,345 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:32,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:32,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1222543527, now seen corresponding path program 1 times [2025-03-03 14:20:32,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:32,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418028390] [2025-03-03 14:20:32,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:32,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:32,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-03 14:20:32,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-03 14:20:32,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:32,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:32,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:32,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418028390] [2025-03-03 14:20:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418028390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:32,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:32,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495601923] [2025-03-03 14:20:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:32,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:32,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:32,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:32,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:32,426 INFO L87 Difference]: Start difference. First operand 4221 states and 6553 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 14:20:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:32,529 INFO L93 Difference]: Finished difference Result 9855 states and 15476 transitions. [2025-03-03 14:20:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 241 [2025-03-03 14:20:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:32,553 INFO L225 Difference]: With dead ends: 9855 [2025-03-03 14:20:32,553 INFO L226 Difference]: Without dead ends: 5867 [2025-03-03 14:20:32,563 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:32,564 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 163 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1681 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:32,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1681 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:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2025-03-03 14:20:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 5835. [2025-03-03 14:20:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5835 states, 4753 states have (on average 1.5348201136124553) internal successors, (7295), 4797 states have internal predecessors, (7295), 910 states have call successors, (910), 163 states have call predecessors, (910), 171 states have return successors, (992), 904 states have call predecessors, (992), 906 states have call successors, (992) [2025-03-03 14:20:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5835 states to 5835 states and 9197 transitions. [2025-03-03 14:20:32,767 INFO L78 Accepts]: Start accepts. Automaton has 5835 states and 9197 transitions. Word has length 241 [2025-03-03 14:20:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:32,767 INFO L471 AbstractCegarLoop]: Abstraction has 5835 states and 9197 transitions. [2025-03-03 14:20:32,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 14:20:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5835 states and 9197 transitions. [2025-03-03 14:20:32,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 14:20:32,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:32,787 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:20:32,788 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:32,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:32,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1602838345, now seen corresponding path program 1 times [2025-03-03 14:20:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:32,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563053868] [2025-03-03 14:20:32,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:32,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:32,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 14:20:32,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 14:20:32,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:32,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:32,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:32,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563053868] [2025-03-03 14:20:32,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563053868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:32,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:32,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128969734] [2025-03-03 14:20:32,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:32,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:32,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:32,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:32,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:32,853 INFO L87 Difference]: Start difference. First operand 5835 states and 9197 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 14:20:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:32,976 INFO L93 Difference]: Finished difference Result 13961 states and 22192 transitions. [2025-03-03 14:20:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:32,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 242 [2025-03-03 14:20:32,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:33,008 INFO L225 Difference]: With dead ends: 13961 [2025-03-03 14:20:33,009 INFO L226 Difference]: Without dead ends: 8481 [2025-03-03 14:20:33,024 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:33,026 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 161 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1676 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:33,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1676 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:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8481 states. [2025-03-03 14:20:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8481 to 8449. [2025-03-03 14:20:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8449 states, 6981 states have (on average 1.545194098266724) internal successors, (10787), 7025 states have internal predecessors, (10787), 1296 states have call successors, (1296), 163 states have call predecessors, (1296), 171 states have return successors, (1378), 1290 states have call predecessors, (1378), 1292 states have call successors, (1378) [2025-03-03 14:20:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8449 states to 8449 states and 13461 transitions. [2025-03-03 14:20:33,307 INFO L78 Accepts]: Start accepts. Automaton has 8449 states and 13461 transitions. Word has length 242 [2025-03-03 14:20:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:33,308 INFO L471 AbstractCegarLoop]: Abstraction has 8449 states and 13461 transitions. [2025-03-03 14:20:33,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 14:20:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8449 states and 13461 transitions. [2025-03-03 14:20:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 14:20:33,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:33,332 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:20:33,332 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1734271257, now seen corresponding path program 1 times [2025-03-03 14:20:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706775911] [2025-03-03 14:20:33,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:33,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:33,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 14:20:33,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 14:20:33,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:33,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:33,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706775911] [2025-03-03 14:20:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706775911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:33,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:33,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:33,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038690344] [2025-03-03 14:20:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:33,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:33,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:33,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:33,393 INFO L87 Difference]: Start difference. First operand 8449 states and 13461 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:33,597 INFO L93 Difference]: Finished difference Result 20419 states and 32800 transitions. [2025-03-03 14:20:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:33,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 236 [2025-03-03 14:20:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:33,639 INFO L225 Difference]: With dead ends: 20419 [2025-03-03 14:20:33,639 INFO L226 Difference]: Without dead ends: 12633 [2025-03-03 14:20:33,653 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:33,654 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 159 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1669 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:33,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1669 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:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12633 states. [2025-03-03 14:20:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12633 to 12601. [2025-03-03 14:20:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12601 states, 10589 states have (on average 1.5556709793181605) internal successors, (16473), 10633 states have internal predecessors, (16473), 1840 states have call successors, (1840), 163 states have call predecessors, (1840), 171 states have return successors, (1954), 1834 states have call predecessors, (1954), 1836 states have call successors, (1954) [2025-03-03 14:20:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12601 states to 12601 states and 20267 transitions. [2025-03-03 14:20:34,037 INFO L78 Accepts]: Start accepts. Automaton has 12601 states and 20267 transitions. Word has length 236 [2025-03-03 14:20:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:34,038 INFO L471 AbstractCegarLoop]: Abstraction has 12601 states and 20267 transitions. [2025-03-03 14:20:34,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 12601 states and 20267 transitions. [2025-03-03 14:20:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-03 14:20:34,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:34,073 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:20:34,073 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:34,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:34,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2077602201, now seen corresponding path program 1 times [2025-03-03 14:20:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037091057] [2025-03-03 14:20:34,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:34,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-03 14:20:34,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-03 14:20:34,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:34,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:34,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037091057] [2025-03-03 14:20:34,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037091057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:34,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:34,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252071178] [2025-03-03 14:20:34,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:34,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:34,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:34,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:34,151 INFO L87 Difference]: Start difference. First operand 12601 states and 20267 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:34,581 INFO L93 Difference]: Finished difference Result 31035 states and 50298 transitions. [2025-03-03 14:20:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 237 [2025-03-03 14:20:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:34,654 INFO L225 Difference]: With dead ends: 31035 [2025-03-03 14:20:34,654 INFO L226 Difference]: Without dead ends: 19607 [2025-03-03 14:20:34,685 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:34,686 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 157 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1669 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:34,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1669 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:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19607 states. [2025-03-03 14:20:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19607 to 19575. [2025-03-03 14:20:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19575 states, 16709 states have (on average 1.5660422526781974) internal successors, (26167), 16753 states have internal predecessors, (26167), 2694 states have call successors, (2694), 163 states have call predecessors, (2694), 171 states have return successors, (2860), 2688 states have call predecessors, (2860), 2690 states have call successors, (2860) [2025-03-03 14:20:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19575 states to 19575 states and 31721 transitions. [2025-03-03 14:20:35,252 INFO L78 Accepts]: Start accepts. Automaton has 19575 states and 31721 transitions. Word has length 237 [2025-03-03 14:20:35,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:35,253 INFO L471 AbstractCegarLoop]: Abstraction has 19575 states and 31721 transitions. [2025-03-03 14:20:35,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 19575 states and 31721 transitions. [2025-03-03 14:20:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-03 14:20:35,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:35,294 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:20:35,294 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:35,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash -849219078, now seen corresponding path program 1 times [2025-03-03 14:20:35,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:35,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821862589] [2025-03-03 14:20:35,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:35,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:35,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-03 14:20:35,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-03 14:20:35,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:35,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:35,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:35,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821862589] [2025-03-03 14:20:35,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821862589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:35,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:35,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:35,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189008201] [2025-03-03 14:20:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:35,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:35,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:35,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:35,352 INFO L87 Difference]: Start difference. First operand 19575 states and 31721 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:35,855 INFO L93 Difference]: Finished difference Result 48455 states and 79064 transitions. [2025-03-03 14:20:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:35,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 238 [2025-03-03 14:20:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:35,961 INFO L225 Difference]: With dead ends: 48455 [2025-03-03 14:20:35,961 INFO L226 Difference]: Without dead ends: 32235 [2025-03-03 14:20:36,001 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:36,001 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 155 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1684 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:36,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1684 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:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32235 states. [2025-03-03 14:20:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32235 to 32203. [2025-03-03 14:20:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32203 states, 27465 states have (on average 1.5671946113235027) internal successors, (43043), 27509 states have internal predecessors, (43043), 4566 states have call successors, (4566), 163 states have call predecessors, (4566), 171 states have return successors, (4820), 4560 states have call predecessors, (4820), 4562 states have call successors, (4820) [2025-03-03 14:20:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32203 states to 32203 states and 52429 transitions. [2025-03-03 14:20:36,927 INFO L78 Accepts]: Start accepts. Automaton has 32203 states and 52429 transitions. Word has length 238 [2025-03-03 14:20:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:36,928 INFO L471 AbstractCegarLoop]: Abstraction has 32203 states and 52429 transitions. [2025-03-03 14:20:36,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 32203 states and 52429 transitions. [2025-03-03 14:20:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-03 14:20:37,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:37,013 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:20:37,013 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:37,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash -730840007, now seen corresponding path program 1 times [2025-03-03 14:20:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020168935] [2025-03-03 14:20:37,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:37,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 14:20:37,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 14:20:37,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:37,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:37,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020168935] [2025-03-03 14:20:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020168935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:37,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:37,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262325640] [2025-03-03 14:20:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:37,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:37,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:37,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:37,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:37,095 INFO L87 Difference]: Start difference. First operand 32203 states and 52429 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 14:20:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:38,179 INFO L93 Difference]: Finished difference Result 83251 states and 136584 transitions. [2025-03-03 14:20:38,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:38,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 246 [2025-03-03 14:20:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:38,383 INFO L225 Difference]: With dead ends: 83251 [2025-03-03 14:20:38,383 INFO L226 Difference]: Without dead ends: 54999 [2025-03-03 14:20:38,446 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:38,446 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 153 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1680 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:38,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1680 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:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54999 states. [2025-03-03 14:20:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54999 to 54967. [2025-03-03 14:20:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54967 states, 47113 states have (on average 1.573217583257275) internal successors, (74119), 47157 states have internal predecessors, (74119), 7682 states have call successors, (7682), 163 states have call predecessors, (7682), 171 states have return successors, (8092), 7676 states have call predecessors, (8092), 7678 states have call successors, (8092) [2025-03-03 14:20:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54967 states to 54967 states and 89893 transitions. [2025-03-03 14:20:39,837 INFO L78 Accepts]: Start accepts. Automaton has 54967 states and 89893 transitions. Word has length 246 [2025-03-03 14:20:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:39,837 INFO L471 AbstractCegarLoop]: Abstraction has 54967 states and 89893 transitions. [2025-03-03 14:20:39,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 14:20:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 54967 states and 89893 transitions. [2025-03-03 14:20:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-03 14:20:39,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:39,956 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 14:20:39,957 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:39,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1875635003, now seen corresponding path program 1 times [2025-03-03 14:20:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:39,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532221799] [2025-03-03 14:20:39,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:39,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-03 14:20:39,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-03 14:20:39,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:39,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:40,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:40,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532221799] [2025-03-03 14:20:40,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532221799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473127947] [2025-03-03 14:20:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:40,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:40,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:40,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:40,017 INFO L87 Difference]: Start difference. First operand 54967 states and 89893 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:41,805 INFO L93 Difference]: Finished difference Result 136469 states and 222042 transitions. [2025-03-03 14:20:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 240 [2025-03-03 14:20:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:42,085 INFO L225 Difference]: With dead ends: 136469 [2025-03-03 14:20:42,085 INFO L226 Difference]: Without dead ends: 88677 [2025-03-03 14:20:42,182 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:42,182 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 151 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1654 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:42,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1654 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:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88677 states. [2025-03-03 14:20:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88677 to 88645. [2025-03-03 14:20:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88645 states, 76153 states have (on average 1.545507071290691) internal successors, (117695), 76197 states have internal predecessors, (117695), 12320 states have call successors, (12320), 163 states have call predecessors, (12320), 171 states have return successors, (13018), 12314 states have call predecessors, (13018), 12316 states have call successors, (13018) [2025-03-03 14:20:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88645 states to 88645 states and 143033 transitions. [2025-03-03 14:20:44,916 INFO L78 Accepts]: Start accepts. Automaton has 88645 states and 143033 transitions. Word has length 240 [2025-03-03 14:20:44,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:44,916 INFO L471 AbstractCegarLoop]: Abstraction has 88645 states and 143033 transitions. [2025-03-03 14:20:44,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 14:20:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 88645 states and 143033 transitions. [2025-03-03 14:20:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-03 14:20:45,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:45,117 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 14:20:45,117 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 111922746, now seen corresponding path program 1 times [2025-03-03 14:20:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139579756] [2025-03-03 14:20:45,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:45,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-03 14:20:45,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-03 14:20:45,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:45,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:45,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139579756] [2025-03-03 14:20:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139579756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:45,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:45,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308115908] [2025-03-03 14:20:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:45,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:45,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:45,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:45,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:45,473 INFO L87 Difference]: Start difference. First operand 88645 states and 143033 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 14:20:48,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:48,830 INFO L93 Difference]: Finished difference Result 240415 states and 389338 transitions. [2025-03-03 14:20:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 248 [2025-03-03 14:20:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:49,347 INFO L225 Difference]: With dead ends: 240415 [2025-03-03 14:20:49,348 INFO L226 Difference]: Without dead ends: 161105 [2025-03-03 14:20:49,505 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,505 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 149 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1673 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,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1673 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,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161105 states. [2025-03-03 14:20:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161105 to 161073. [2025-03-03 14:20:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161073 states, 139009 states have (on average 1.5456768986180751) internal successors, (214863), 139053 states have internal predecessors, (214863), 21892 states have call successors, (21892), 163 states have call predecessors, (21892), 171 states have return successors, (23138), 21886 states have call predecessors, (23138), 21888 states have call successors, (23138) [2025-03-03 14:20:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161073 states to 161073 states and 259893 transitions. [2025-03-03 14:20:55,216 INFO L78 Accepts]: Start accepts. Automaton has 161073 states and 259893 transitions. Word has length 248 [2025-03-03 14:20:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:55,216 INFO L471 AbstractCegarLoop]: Abstraction has 161073 states and 259893 transitions. [2025-03-03 14:20:55,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 14:20:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 161073 states and 259893 transitions. [2025-03-03 14:20:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 14:20:55,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:55,535 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 14:20:55,536 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2067973124, now seen corresponding path program 1 times [2025-03-03 14:20:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281196304] [2025-03-03 14:20:55,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:55,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 14:20:55,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 14:20:55,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:55,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:20:55,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:55,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281196304] [2025-03-03 14:20:55,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281196304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:55,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:55,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954810635] [2025-03-03 14:20:55,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:55,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:55,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:55,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:55,595 INFO L87 Difference]: Start difference. First operand 161073 states and 259893 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)