./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product12.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 cd09b7e02dd7459ada96201e9b5a915c0f0209c05135bf5a5174f874492a34ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:36:08,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:36:08,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:36:08,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:36:08,959 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:36:08,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:36:08,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:36:08,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:36:08,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:36:08,981 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:36:08,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:36:08,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:36:08,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:36:08,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:36:08,983 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:36:08,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:36:08,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:36:08,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:36:08,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:36:08,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:36:08,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:36:08,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:36:08,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:36:08,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:36:08,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:36:08,985 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:36:08,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:36:08,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:36:08,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:36:08,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:36:08,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:36:08,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:36:08,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:36:08,986 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 -> cd09b7e02dd7459ada96201e9b5a915c0f0209c05135bf5a5174f874492a34ab [2025-03-08 05:36:09,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:36:09,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:36:09,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:36:09,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:36:09,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:36:09,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product12.cil.c [2025-03-08 05:36:10,274 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ae9f113/11dbeffb3c11409697d3080b34931cbe/FLAGe5bd12f94 [2025-03-08 05:36:10,612 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:36:10,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product12.cil.c [2025-03-08 05:36:10,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ae9f113/11dbeffb3c11409697d3080b34931cbe/FLAGe5bd12f94 [2025-03-08 05:36:10,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ae9f113/11dbeffb3c11409697d3080b34931cbe [2025-03-08 05:36:10,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:36:10,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:36:10,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:36:10,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:36:10,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:36:10,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:10" (1/1) ... [2025-03-08 05:36:10,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa4779b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:10, skipping insertion in model container [2025-03-08 05:36:10,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:36:10" (1/1) ... [2025-03-08 05:36:10,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:36:10,960 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_spec8_product12.cil.c[16969,16982] [2025-03-08 05:36:11,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:36:11,086 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:36:11,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [414] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [717] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [752] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [761] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [974] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [1386] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1428] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1533] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1765] [2025-03-08 05:36:11,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2834] [2025-03-08 05:36:11,120 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_spec8_product12.cil.c[16969,16982] [2025-03-08 05:36:11,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:36:11,207 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:36:11,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11 WrapperNode [2025-03-08 05:36:11,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:36:11,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:36:11,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:36:11,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:36:11,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,257 INFO L138 Inliner]: procedures = 123, calls = 177, calls flagged for inlining = 51, calls inlined = 41, statements flattened = 837 [2025-03-08 05:36:11,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:36:11,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:36:11,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:36:11,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:36:11,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,284 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-08 05:36:11,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,308 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:36:11,309 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:36:11,309 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:36:11,309 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:36:11,310 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (1/1) ... [2025-03-08 05:36:11,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:36:11,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:11,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:36:11,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:36:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:36:11,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:36:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:36:11,366 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:36:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:36:11,366 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:36:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:36:11,366 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:36:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:36:11,366 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:36:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:36:11,366 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:36:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:36:11,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:36:11,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:36:11,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:36:11,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2811-1: getClientId_#res#1 := getClientId_~retValue_acc~42#1; [2025-03-08 05:36:11,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2376-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~35#1; [2025-03-08 05:36:11,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2692-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~40#1; [2025-03-08 05:36:11,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~25#1; [2025-03-08 05:36:11,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1104: #res := ~retValue_acc~9; [2025-03-08 05:36:11,735 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2423-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~36#1; [2025-03-08 05:36:11,735 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2468: #res#1 := ~retValue_acc~37#1; [2025-03-08 05:36:11,769 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1530-1: createEmail_#res#1 := createEmail_~retValue_acc~20#1; [2025-03-08 05:36:11,783 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1219: #res := ~retValue_acc~12; [2025-03-08 05:36:12,031 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2638-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~39#1; [2025-03-08 05:36:12,031 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~38#1; [2025-03-08 05:36:12,031 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-03-08 05:36:12,032 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1709-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-03-08 05:36:12,032 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1718-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-03-08 05:36:12,032 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-03-08 05:36:12,052 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1256: #res := ~retValue_acc~13; [2025-03-08 05:36:12,121 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-08 05:36:12,121 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:36:12,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:36:12,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:36:12,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:12 BoogieIcfgContainer [2025-03-08 05:36:12,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:36:12,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:36:12,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:36:12,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:36:12,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:36:10" (1/3) ... [2025-03-08 05:36:12,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b46ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:12, skipping insertion in model container [2025-03-08 05:36:12,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:36:11" (2/3) ... [2025-03-08 05:36:12,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b46ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:36:12, skipping insertion in model container [2025-03-08 05:36:12,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:36:12" (3/3) ... [2025-03-08 05:36:12,139 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product12.cil.c [2025-03-08 05:36:12,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:36:12,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product12.cil.c that has 16 procedures, 260 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:36:12,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:36:12,208 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;@3bee387e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:36:12,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:36:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 204 states have (on average 1.553921568627451) internal successors, (317), 208 states have internal predecessors, (317), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 05:36:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:36:12,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:12,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:12,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1422546338, now seen corresponding path program 1 times [2025-03-08 05:36:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813458316] [2025-03-08 05:36:12,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:12,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:36:12,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:36:12,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:12,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:36:12,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813458316] [2025-03-08 05:36:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813458316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16491843] [2025-03-08 05:36:12,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:12,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:12,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:12,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:36:12,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:36:13,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:36:13,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:13,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:13,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:36:13,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:36:13,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:13,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16491843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:13,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:13,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:36:13,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884823169] [2025-03-08 05:36:13,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:13,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:13,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:13,084 INFO L87 Difference]: Start difference. First operand has 260 states, 204 states have (on average 1.553921568627451) internal successors, (317), 208 states have internal predecessors, (317), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:36:13,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:13,143 INFO L93 Difference]: Finished difference Result 374 states and 558 transitions. [2025-03-08 05:36:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-08 05:36:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:13,155 INFO L225 Difference]: With dead ends: 374 [2025-03-08 05:36:13,155 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 05:36:13,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:13,160 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 0 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:13,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 05:36:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-03-08 05:36:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 202 states have internal predecessors, (308), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 05:36:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2025-03-08 05:36:13,204 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 86 [2025-03-08 05:36:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:13,205 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2025-03-08 05:36:13,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:36:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2025-03-08 05:36:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:36:13,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:13,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:13,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:13,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:36:13,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1666121766, now seen corresponding path program 1 times [2025-03-08 05:36:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976522730] [2025-03-08 05:36:13,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:13,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:36:13,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:36:13,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:13,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:36:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976522730] [2025-03-08 05:36:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976522730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929154573] [2025-03-08 05:36:13,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:13,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:13,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:13,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:13,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:36:13,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:36:13,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:36:13,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:13,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:13,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:36:13,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:36:13,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929154573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:13,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:36:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002455092] [2025-03-08 05:36:13,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:13,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:13,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:13,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:13,916 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:36:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:13,946 INFO L93 Difference]: Finished difference Result 532 states and 820 transitions. [2025-03-08 05:36:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:13,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-03-08 05:36:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:13,950 INFO L225 Difference]: With dead ends: 532 [2025-03-08 05:36:13,951 INFO L226 Difference]: Without dead ends: 304 [2025-03-08 05:36:13,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:36:13,953 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 99 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:13,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 729 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-08 05:36:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2025-03-08 05:36:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 230 states have (on average 1.565217391304348) internal successors, (360), 233 states have internal predecessors, (360), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 05:36:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 459 transitions. [2025-03-08 05:36:13,972 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 459 transitions. Word has length 90 [2025-03-08 05:36:13,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:13,973 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 459 transitions. [2025-03-08 05:36:13,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:36:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 459 transitions. [2025-03-08 05:36:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 05:36:13,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:13,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:13,985 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-08 05:36:14,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:36:14,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:14,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1600328531, now seen corresponding path program 1 times [2025-03-08 05:36:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:14,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110810862] [2025-03-08 05:36:14,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:14,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:14,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:36:14,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:36:14,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:14,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:36:14,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:14,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110810862] [2025-03-08 05:36:14,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110810862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:14,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194900062] [2025-03-08 05:36:14,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:14,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:14,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:14,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:14,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:36:14,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:36:14,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:36:14,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:14,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:14,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:36:14,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:36:14,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:14,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194900062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:14,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:14,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:36:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990826594] [2025-03-08 05:36:14,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:14,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:14,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:14,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:14,635 INFO L87 Difference]: Start difference. First operand 296 states and 459 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:36:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:14,689 INFO L93 Difference]: Finished difference Result 583 states and 908 transitions. [2025-03-08 05:36:14,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:14,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2025-03-08 05:36:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:14,692 INFO L225 Difference]: With dead ends: 583 [2025-03-08 05:36:14,692 INFO L226 Difference]: Without dead ends: 298 [2025-03-08 05:36:14,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:14,694 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:14,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-08 05:36:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-08 05:36:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 231 states have (on average 1.5627705627705628) internal successors, (361), 235 states have internal predecessors, (361), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2025-03-08 05:36:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 462 transitions. [2025-03-08 05:36:14,724 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 462 transitions. Word has length 91 [2025-03-08 05:36:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:14,725 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 462 transitions. [2025-03-08 05:36:14,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:36:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 462 transitions. [2025-03-08 05:36:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:36:14,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:14,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:14,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:14,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:14,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:14,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1571415346, now seen corresponding path program 1 times [2025-03-08 05:36:14,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:14,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181292838] [2025-03-08 05:36:14,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:14,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:14,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:36:14,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:36:14,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:14,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:36:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181292838] [2025-03-08 05:36:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181292838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533874794] [2025-03-08 05:36:15,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:15,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:15,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:15,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:36:15,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:36:15,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:36:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:36:15,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:15,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:15,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:36:15,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:36:15,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:36:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533874794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:15,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:36:15,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:36:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76699685] [2025-03-08 05:36:15,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:15,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:15,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:15,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:36:15,367 INFO L87 Difference]: Start difference. First operand 298 states and 462 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:36:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:15,417 INFO L93 Difference]: Finished difference Result 585 states and 913 transitions. [2025-03-08 05:36:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:15,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2025-03-08 05:36:15,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:15,422 INFO L225 Difference]: With dead ends: 585 [2025-03-08 05:36:15,422 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 05:36:15,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:36:15,425 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:15,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1479 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:15,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 05:36:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-08 05:36:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 237 states have internal predecessors, (362), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2025-03-08 05:36:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 468 transitions. [2025-03-08 05:36:15,445 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 468 transitions. Word has length 92 [2025-03-08 05:36:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:15,445 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 468 transitions. [2025-03-08 05:36:15,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:36:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 468 transitions. [2025-03-08 05:36:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:36:15,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:15,447 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:15,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:36:15,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:15,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:15,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1432458141, now seen corresponding path program 1 times [2025-03-08 05:36:15,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:15,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345906542] [2025-03-08 05:36:15,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:15,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:36:15,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:36:15,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:15,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:36:15,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:15,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345906542] [2025-03-08 05:36:15,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345906542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:15,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:15,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562693883] [2025-03-08 05:36:15,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:15,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:15,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:15,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:15,779 INFO L87 Difference]: Start difference. First operand 300 states and 468 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:36:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:15,818 INFO L93 Difference]: Finished difference Result 577 states and 904 transitions. [2025-03-08 05:36:15,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:15,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-03-08 05:36:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:15,820 INFO L225 Difference]: With dead ends: 577 [2025-03-08 05:36:15,821 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 05:36:15,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:15,822 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:15,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1497 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 05:36:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-08 05:36:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 237 states have internal predecessors, (362), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2025-03-08 05:36:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 467 transitions. [2025-03-08 05:36:15,835 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 467 transitions. Word has length 93 [2025-03-08 05:36:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:15,835 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 467 transitions. [2025-03-08 05:36:15,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:36:15,835 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 467 transitions. [2025-03-08 05:36:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:36:15,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:15,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:15,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:36:15,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:15,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:15,837 INFO L85 PathProgramCache]: Analyzing trace with hash 239377152, now seen corresponding path program 2 times [2025-03-08 05:36:15,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:15,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932927953] [2025-03-08 05:36:15,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:36:15,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:15,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 94 statements into 2 equivalence classes. [2025-03-08 05:36:15,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:36:15,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:36:15,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:36:15,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:15,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932927953] [2025-03-08 05:36:15,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932927953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:15,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:15,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967954478] [2025-03-08 05:36:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:15,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:15,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:15,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:15,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:15,986 INFO L87 Difference]: Start difference. First operand 300 states and 467 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:36:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:16,028 INFO L93 Difference]: Finished difference Result 575 states and 899 transitions. [2025-03-08 05:36:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:16,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-03-08 05:36:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:16,030 INFO L225 Difference]: With dead ends: 575 [2025-03-08 05:36:16,030 INFO L226 Difference]: Without dead ends: 300 [2025-03-08 05:36:16,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:16,032 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 2 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:16,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1483 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-08 05:36:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-08 05:36:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 232 states have (on average 1.5603448275862069) internal successors, (362), 237 states have internal predecessors, (362), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (54), 49 states have call predecessors, (54), 49 states have call successors, (54) [2025-03-08 05:36:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 466 transitions. [2025-03-08 05:36:16,042 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 466 transitions. Word has length 94 [2025-03-08 05:36:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:16,042 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 466 transitions. [2025-03-08 05:36:16,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:36:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 466 transitions. [2025-03-08 05:36:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:36:16,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:16,044 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:36:16,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:36:16,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:16,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1202535927, now seen corresponding path program 3 times [2025-03-08 05:36:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636127412] [2025-03-08 05:36:16,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:36:16,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:16,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 3 equivalence classes. [2025-03-08 05:36:16,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 83 of 95 statements. [2025-03-08 05:36:16,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:36:16,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:36:16,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:16,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636127412] [2025-03-08 05:36:16,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636127412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:16,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:16,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:16,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029175184] [2025-03-08 05:36:16,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:16,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:16,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:16,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:16,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:16,139 INFO L87 Difference]: Start difference. First operand 300 states and 466 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:36:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:16,154 INFO L93 Difference]: Finished difference Result 451 states and 681 transitions. [2025-03-08 05:36:16,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:16,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2025-03-08 05:36:16,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:16,158 INFO L225 Difference]: With dead ends: 451 [2025-03-08 05:36:16,158 INFO L226 Difference]: Without dead ends: 349 [2025-03-08 05:36:16,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:16,159 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 279 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:16,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 516 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-08 05:36:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-03-08 05:36:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 272 states have (on average 1.5588235294117647) internal successors, (424), 277 states have internal predecessors, (424), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (58), 53 states have call predecessors, (58), 53 states have call successors, (58) [2025-03-08 05:36:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 536 transitions. [2025-03-08 05:36:16,171 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 536 transitions. Word has length 95 [2025-03-08 05:36:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:16,172 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 536 transitions. [2025-03-08 05:36:16,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 05:36:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 536 transitions. [2025-03-08 05:36:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:36:16,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:16,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 05:36:16,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:36:16,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:16,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash 533658326, now seen corresponding path program 1 times [2025-03-08 05:36:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184827770] [2025-03-08 05:36:16,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:16,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:36:16,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:36:16,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:16,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:36:16,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:16,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184827770] [2025-03-08 05:36:16,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184827770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:16,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:16,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071055781] [2025-03-08 05:36:16,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:16,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:16,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:16,313 INFO L87 Difference]: Start difference. First operand 349 states and 536 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:16,348 INFO L93 Difference]: Finished difference Result 677 states and 1045 transitions. [2025-03-08 05:36:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-03-08 05:36:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:16,352 INFO L225 Difference]: With dead ends: 677 [2025-03-08 05:36:16,352 INFO L226 Difference]: Without dead ends: 351 [2025-03-08 05:36:16,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:16,354 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 1 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:16,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1496 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-08 05:36:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-08 05:36:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.5567765567765568) internal successors, (425), 279 states have internal predecessors, (425), 54 states have call successors, (54), 21 states have call predecessors, (54), 23 states have return successors, (60), 53 states have call predecessors, (60), 53 states have call successors, (60) [2025-03-08 05:36:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 539 transitions. [2025-03-08 05:36:16,380 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 539 transitions. Word has length 149 [2025-03-08 05:36:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:16,380 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 539 transitions. [2025-03-08 05:36:16,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 05:36:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 539 transitions. [2025-03-08 05:36:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 05:36:16,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:16,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-08 05:36:16,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:36:16,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:16,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:16,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1200402704, now seen corresponding path program 1 times [2025-03-08 05:36:16,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:16,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839577810] [2025-03-08 05:36:16,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:16,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:16,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:36:16,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:36:16,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:16,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:36:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839577810] [2025-03-08 05:36:16,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839577810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:16,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:16,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:36:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746324435] [2025-03-08 05:36:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:16,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:36:16,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:16,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:36:16,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:36:16,534 INFO L87 Difference]: Start difference. First operand 351 states and 539 transitions. Second operand has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:36:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:16,645 INFO L93 Difference]: Finished difference Result 682 states and 1054 transitions. [2025-03-08 05:36:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:36:16,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 150 [2025-03-08 05:36:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:16,647 INFO L225 Difference]: With dead ends: 682 [2025-03-08 05:36:16,647 INFO L226 Difference]: Without dead ends: 356 [2025-03-08 05:36:16,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:36:16,649 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 5 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:16,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2554 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:36:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-08 05:36:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-08 05:36:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 277 states have (on average 1.552346570397112) internal successors, (430), 283 states have internal predecessors, (430), 54 states have call successors, (54), 22 states have call predecessors, (54), 24 states have return successors, (65), 53 states have call predecessors, (65), 53 states have call successors, (65) [2025-03-08 05:36:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 549 transitions. [2025-03-08 05:36:16,664 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 549 transitions. Word has length 150 [2025-03-08 05:36:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:16,664 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 549 transitions. [2025-03-08 05:36:16,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-08 05:36:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 549 transitions. [2025-03-08 05:36:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 05:36:16,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:16,666 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:16,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:36:16,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:16,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:16,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2097011960, now seen corresponding path program 1 times [2025-03-08 05:36:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624029306] [2025-03-08 05:36:16,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:16,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:36:16,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:36:16,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:16,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:16,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624029306] [2025-03-08 05:36:16,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624029306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232418492] [2025-03-08 05:36:16,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:16,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:16,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:16,779 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-08 05:36:16,781 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-08 05:36:16,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:36:17,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:36:17,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:17,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:17,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:36:17,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-08 05:36:17,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:36:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232418492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:36:17,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:36:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:36:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252811402] [2025-03-08 05:36:17,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:36:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:36:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:17,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:36:17,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:36:17,160 INFO L87 Difference]: Start difference. First operand 356 states and 549 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:36:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:17,281 INFO L93 Difference]: Finished difference Result 828 states and 1326 transitions. [2025-03-08 05:36:17,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:36:17,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 151 [2025-03-08 05:36:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:17,287 INFO L225 Difference]: With dead ends: 828 [2025-03-08 05:36:17,287 INFO L226 Difference]: Without dead ends: 672 [2025-03-08 05:36:17,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:36:17,289 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 291 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:17,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1848 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:36:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-08 05:36:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 648. [2025-03-08 05:36:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 505 states have (on average 1.617821782178218) internal successors, (817), 511 states have internal predecessors, (817), 118 states have call successors, (118), 22 states have call predecessors, (118), 24 states have return successors, (139), 117 states have call predecessors, (139), 117 states have call successors, (139) [2025-03-08 05:36:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1074 transitions. [2025-03-08 05:36:17,320 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1074 transitions. Word has length 151 [2025-03-08 05:36:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:17,320 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 1074 transitions. [2025-03-08 05:36:17,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:36:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1074 transitions. [2025-03-08 05:36:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:36:17,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:17,324 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:17,333 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-08 05:36:17,525 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,SelfDestructingSolverStorable9 [2025-03-08 05:36:17,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:17,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash 483415906, now seen corresponding path program 1 times [2025-03-08 05:36:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553073080] [2025-03-08 05:36:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:17,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:36:17,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:36:17,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:17,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:17,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:17,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553073080] [2025-03-08 05:36:17,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553073080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:17,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:17,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:17,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847990399] [2025-03-08 05:36:17,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:17,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:17,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:17,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:17,588 INFO L87 Difference]: Start difference. First operand 648 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:17,636 INFO L93 Difference]: Finished difference Result 1525 states and 2568 transitions. [2025-03-08 05:36:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 158 [2025-03-08 05:36:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:17,642 INFO L225 Difference]: With dead ends: 1525 [2025-03-08 05:36:17,643 INFO L226 Difference]: Without dead ends: 944 [2025-03-08 05:36:17,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:17,645 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 97 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:17,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 767 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-08 05:36:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 936. [2025-03-08 05:36:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 729 states have (on average 1.6323731138545954) internal successors, (1190), 735 states have internal predecessors, (1190), 182 states have call successors, (182), 22 states have call predecessors, (182), 24 states have return successors, (213), 181 states have call predecessors, (213), 181 states have call successors, (213) [2025-03-08 05:36:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1585 transitions. [2025-03-08 05:36:17,686 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1585 transitions. Word has length 158 [2025-03-08 05:36:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:17,687 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1585 transitions. [2025-03-08 05:36:17,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1585 transitions. [2025-03-08 05:36:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 05:36:17,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:17,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:17,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:36:17,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:17,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:17,693 INFO L85 PathProgramCache]: Analyzing trace with hash -428892740, now seen corresponding path program 1 times [2025-03-08 05:36:17,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:17,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326796710] [2025-03-08 05:36:17,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:17,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:17,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 05:36:17,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 05:36:17,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:17,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:17,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:17,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326796710] [2025-03-08 05:36:17,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326796710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:17,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596063865] [2025-03-08 05:36:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:17,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:17,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:17,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:17,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:17,758 INFO L87 Difference]: Start difference. First operand 936 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:17,800 INFO L93 Difference]: Finished difference Result 2212 states and 3769 transitions. [2025-03-08 05:36:17,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:17,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 159 [2025-03-08 05:36:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:17,808 INFO L225 Difference]: With dead ends: 2212 [2025-03-08 05:36:17,808 INFO L226 Difference]: Without dead ends: 1392 [2025-03-08 05:36:17,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:17,812 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 95 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:17,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 760 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-08 05:36:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1384. [2025-03-08 05:36:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1082 states have (on average 1.6423290203327172) internal successors, (1777), 1088 states have internal predecessors, (1777), 277 states have call successors, (277), 22 states have call predecessors, (277), 24 states have return successors, (308), 276 states have call predecessors, (308), 276 states have call successors, (308) [2025-03-08 05:36:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2362 transitions. [2025-03-08 05:36:17,888 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2362 transitions. Word has length 159 [2025-03-08 05:36:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:17,888 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2362 transitions. [2025-03-08 05:36:17,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2362 transitions. [2025-03-08 05:36:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:36:17,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:17,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:17,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:36:17,897 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:17,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash -490762591, now seen corresponding path program 1 times [2025-03-08 05:36:17,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:17,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075320487] [2025-03-08 05:36:17,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:17,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:36:17,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:36:17,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:17,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:17,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:17,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075320487] [2025-03-08 05:36:17,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075320487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:17,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:17,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38209816] [2025-03-08 05:36:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:17,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:17,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:17,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:17,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:17,960 INFO L87 Difference]: Start difference. First operand 1384 states and 2362 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:18,023 INFO L93 Difference]: Finished difference Result 3213 states and 5530 transitions. [2025-03-08 05:36:18,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:18,023 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 160 [2025-03-08 05:36:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:18,035 INFO L225 Difference]: With dead ends: 3213 [2025-03-08 05:36:18,035 INFO L226 Difference]: Without dead ends: 2063 [2025-03-08 05:36:18,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:18,041 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 93 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:18,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 755 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-03-08 05:36:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2055. [2025-03-08 05:36:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1630 states have (on average 1.650920245398773) internal successors, (2691), 1636 states have internal predecessors, (2691), 400 states have call successors, (400), 22 states have call predecessors, (400), 24 states have return successors, (447), 399 states have call predecessors, (447), 399 states have call successors, (447) [2025-03-08 05:36:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3538 transitions. [2025-03-08 05:36:18,160 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3538 transitions. Word has length 160 [2025-03-08 05:36:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:18,160 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 3538 transitions. [2025-03-08 05:36:18,160 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3538 transitions. [2025-03-08 05:36:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 05:36:18,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:18,173 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:18,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:36:18,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:18,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash 916292637, now seen corresponding path program 1 times [2025-03-08 05:36:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:18,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097960483] [2025-03-08 05:36:18,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:18,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 05:36:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 05:36:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:18,250 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:18,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:18,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097960483] [2025-03-08 05:36:18,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097960483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:18,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:18,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514591816] [2025-03-08 05:36:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:18,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:18,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:18,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:18,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:18,252 INFO L87 Difference]: Start difference. First operand 2055 states and 3538 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:18,361 INFO L93 Difference]: Finished difference Result 4755 states and 8250 transitions. [2025-03-08 05:36:18,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:18,362 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2025-03-08 05:36:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:18,380 INFO L225 Difference]: With dead ends: 4755 [2025-03-08 05:36:18,381 INFO L226 Difference]: Without dead ends: 3127 [2025-03-08 05:36:18,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:18,389 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 91 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:18,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 755 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2025-03-08 05:36:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3119. [2025-03-08 05:36:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 2515 states have (on average 1.656858846918489) internal successors, (4167), 2521 states have internal predecessors, (4167), 579 states have call successors, (579), 22 states have call predecessors, (579), 24 states have return successors, (652), 578 states have call predecessors, (652), 578 states have call successors, (652) [2025-03-08 05:36:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 5398 transitions. [2025-03-08 05:36:18,542 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 5398 transitions. Word has length 161 [2025-03-08 05:36:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:18,542 INFO L471 AbstractCegarLoop]: Abstraction has 3119 states and 5398 transitions. [2025-03-08 05:36:18,542 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 5398 transitions. [2025-03-08 05:36:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:36:18,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:18,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:18,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:36:18,560 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:18,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1898938624, now seen corresponding path program 1 times [2025-03-08 05:36:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084915039] [2025-03-08 05:36:18,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:18,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:36:18,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:36:18,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:18,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084915039] [2025-03-08 05:36:18,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084915039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:18,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:18,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807349102] [2025-03-08 05:36:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:18,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:18,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:18,627 INFO L87 Difference]: Start difference. First operand 3119 states and 5398 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:18,785 INFO L93 Difference]: Finished difference Result 7540 states and 13116 transitions. [2025-03-08 05:36:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:18,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2025-03-08 05:36:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:18,818 INFO L225 Difference]: With dead ends: 7540 [2025-03-08 05:36:18,819 INFO L226 Difference]: Without dead ends: 5064 [2025-03-08 05:36:18,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:18,831 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 89 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:18,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 774 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2025-03-08 05:36:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5056. [2025-03-08 05:36:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 4076 states have (on average 1.649901864573111) internal successors, (6725), 4082 states have internal predecessors, (6725), 955 states have call successors, (955), 22 states have call predecessors, (955), 24 states have return successors, (1072), 954 states have call predecessors, (1072), 954 states have call successors, (1072) [2025-03-08 05:36:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 8752 transitions. [2025-03-08 05:36:19,091 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 8752 transitions. Word has length 162 [2025-03-08 05:36:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:19,091 INFO L471 AbstractCegarLoop]: Abstraction has 5056 states and 8752 transitions. [2025-03-08 05:36:19,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 8752 transitions. [2025-03-08 05:36:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:36:19,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:19,121 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:19,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:36:19,121 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:19,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1694666306, now seen corresponding path program 1 times [2025-03-08 05:36:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115684945] [2025-03-08 05:36:19,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:19,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:36:19,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:36:19,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:19,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115684945] [2025-03-08 05:36:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115684945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:19,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:19,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172024111] [2025-03-08 05:36:19,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:19,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:19,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:19,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:19,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:19,232 INFO L87 Difference]: Start difference. First operand 5056 states and 8752 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:19,424 INFO L93 Difference]: Finished difference Result 12444 states and 21676 transitions. [2025-03-08 05:36:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:19,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2025-03-08 05:36:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:19,474 INFO L225 Difference]: With dead ends: 12444 [2025-03-08 05:36:19,474 INFO L226 Difference]: Without dead ends: 8386 [2025-03-08 05:36:19,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-08 05:36:19,493 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 87 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:19,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 758 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8386 states. [2025-03-08 05:36:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8386 to 8378. [2025-03-08 05:36:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8378 states, 6792 states have (on average 1.6479681978798586) internal successors, (11193), 6798 states have internal predecessors, (11193), 1561 states have call successors, (1561), 22 states have call predecessors, (1561), 24 states have return successors, (1756), 1560 states have call predecessors, (1756), 1560 states have call successors, (1756) [2025-03-08 05:36:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8378 states to 8378 states and 14510 transitions. [2025-03-08 05:36:19,888 INFO L78 Accepts]: Start accepts. Automaton has 8378 states and 14510 transitions. Word has length 163 [2025-03-08 05:36:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:19,888 INFO L471 AbstractCegarLoop]: Abstraction has 8378 states and 14510 transitions. [2025-03-08 05:36:19,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 8378 states and 14510 transitions. [2025-03-08 05:36:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:36:19,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:19,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:36:19,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:19,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1512360193, now seen corresponding path program 1 times [2025-03-08 05:36:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828389288] [2025-03-08 05:36:19,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:19,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:36:19,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:36:19,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:19,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:20,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:20,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828389288] [2025-03-08 05:36:20,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828389288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:20,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:20,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:20,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232548533] [2025-03-08 05:36:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:20,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:20,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:20,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:20,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:20,022 INFO L87 Difference]: Start difference. First operand 8378 states and 14510 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:20,488 INFO L93 Difference]: Finished difference Result 21663 states and 37661 transitions. [2025-03-08 05:36:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:20,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-03-08 05:36:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:20,555 INFO L225 Difference]: With dead ends: 21663 [2025-03-08 05:36:20,555 INFO L226 Difference]: Without dead ends: 14676 [2025-03-08 05:36:20,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:20,588 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 85 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:20,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 776 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14676 states. [2025-03-08 05:36:21,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14676 to 14668. [2025-03-08 05:36:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14668 states, 11879 states have (on average 1.6378483037292701) internal successors, (19456), 11885 states have internal predecessors, (19456), 2764 states have call successors, (2764), 22 states have call predecessors, (2764), 24 states have return successors, (3103), 2763 states have call predecessors, (3103), 2763 states have call successors, (3103) [2025-03-08 05:36:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14668 states to 14668 states and 25323 transitions. [2025-03-08 05:36:21,218 INFO L78 Accepts]: Start accepts. Automaton has 14668 states and 25323 transitions. Word has length 164 [2025-03-08 05:36:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:21,218 INFO L471 AbstractCegarLoop]: Abstraction has 14668 states and 25323 transitions. [2025-03-08 05:36:21,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14668 states and 25323 transitions. [2025-03-08 05:36:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 05:36:21,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:21,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:21,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:36:21,272 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:21,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1624895519, now seen corresponding path program 1 times [2025-03-08 05:36:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:21,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976109115] [2025-03-08 05:36:21,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:21,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:21,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 05:36:21,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 05:36:21,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:21,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:21,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:21,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976109115] [2025-03-08 05:36:21,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976109115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:21,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:21,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687559675] [2025-03-08 05:36:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:21,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:21,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:21,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:21,337 INFO L87 Difference]: Start difference. First operand 14668 states and 25323 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:21,937 INFO L93 Difference]: Finished difference Result 38784 states and 67269 transitions. [2025-03-08 05:36:21,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:21,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 165 [2025-03-08 05:36:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:22,051 INFO L225 Difference]: With dead ends: 38784 [2025-03-08 05:36:22,051 INFO L226 Difference]: Without dead ends: 26077 [2025-03-08 05:36:22,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:22,095 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 83 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:22,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 758 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26077 states. [2025-03-08 05:36:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26077 to 26069. [2025-03-08 05:36:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26069 states, 21241 states have (on average 1.6333976743091192) internal successors, (34695), 21247 states have internal predecessors, (34695), 4803 states have call successors, (4803), 22 states have call predecessors, (4803), 24 states have return successors, (5416), 4802 states have call predecessors, (5416), 4802 states have call successors, (5416) [2025-03-08 05:36:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26069 states to 26069 states and 44914 transitions. [2025-03-08 05:36:23,375 INFO L78 Accepts]: Start accepts. Automaton has 26069 states and 44914 transitions. Word has length 165 [2025-03-08 05:36:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:23,375 INFO L471 AbstractCegarLoop]: Abstraction has 26069 states and 44914 transitions. [2025-03-08 05:36:23,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 26069 states and 44914 transitions. [2025-03-08 05:36:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:36:23,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:23,481 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:23,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:36:23,482 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:23,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 87254951, now seen corresponding path program 2 times [2025-03-08 05:36:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533446895] [2025-03-08 05:36:23,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:36:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:23,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 166 statements into 2 equivalence classes. [2025-03-08 05:36:23,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:36:23,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:36:23,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-08 05:36:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:23,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533446895] [2025-03-08 05:36:23,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533446895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:23,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:23,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:36:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722051814] [2025-03-08 05:36:23,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:23,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:36:23,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:23,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:36:23,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:23,629 INFO L87 Difference]: Start difference. First operand 26069 states and 44914 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:24,386 INFO L93 Difference]: Finished difference Result 49282 states and 85063 transitions. [2025-03-08 05:36:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:36:24,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 166 [2025-03-08 05:36:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:24,512 INFO L225 Difference]: With dead ends: 49282 [2025-03-08 05:36:24,512 INFO L226 Difference]: Without dead ends: 26077 [2025-03-08 05:36:24,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:36:24,573 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 96 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:24,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1880 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26077 states. [2025-03-08 05:36:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26077 to 26069. [2025-03-08 05:36:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26069 states, 21241 states have (on average 1.6208747234122687) internal successors, (34429), 21247 states have internal predecessors, (34429), 4803 states have call successors, (4803), 22 states have call predecessors, (4803), 24 states have return successors, (5416), 4802 states have call predecessors, (5416), 4802 states have call successors, (5416) [2025-03-08 05:36:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26069 states to 26069 states and 44648 transitions. [2025-03-08 05:36:25,536 INFO L78 Accepts]: Start accepts. Automaton has 26069 states and 44648 transitions. Word has length 166 [2025-03-08 05:36:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:25,536 INFO L471 AbstractCegarLoop]: Abstraction has 26069 states and 44648 transitions. [2025-03-08 05:36:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26069 states and 44648 transitions. [2025-03-08 05:36:25,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 05:36:25,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:25,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:25,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:36:25,609 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:25,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1099089438, now seen corresponding path program 1 times [2025-03-08 05:36:25,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:25,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312118894] [2025-03-08 05:36:25,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:25,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 05:36:25,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 05:36:25,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:25,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:25,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:25,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312118894] [2025-03-08 05:36:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312118894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:25,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:25,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015743771] [2025-03-08 05:36:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:25,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:25,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:25,668 INFO L87 Difference]: Start difference. First operand 26069 states and 44648 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:27,176 INFO L93 Difference]: Finished difference Result 70956 states and 121941 transitions. [2025-03-08 05:36:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:27,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 166 [2025-03-08 05:36:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:27,425 INFO L225 Difference]: With dead ends: 70956 [2025-03-08 05:36:27,425 INFO L226 Difference]: Without dead ends: 47534 [2025-03-08 05:36:27,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:27,524 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 81 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:27,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 758 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47534 states. [2025-03-08 05:36:29,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47534 to 47526. [2025-03-08 05:36:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47526 states, 38983 states have (on average 1.614062540081574) internal successors, (62921), 38989 states have internal predecessors, (62921), 8518 states have call successors, (8518), 22 states have call predecessors, (8518), 24 states have return successors, (9663), 8517 states have call predecessors, (9663), 8517 states have call successors, (9663) [2025-03-08 05:36:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47526 states to 47526 states and 81102 transitions. [2025-03-08 05:36:29,478 INFO L78 Accepts]: Start accepts. Automaton has 47526 states and 81102 transitions. Word has length 166 [2025-03-08 05:36:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:29,478 INFO L471 AbstractCegarLoop]: Abstraction has 47526 states and 81102 transitions. [2025-03-08 05:36:29,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 47526 states and 81102 transitions. [2025-03-08 05:36:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:36:29,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:29,967 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:29,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:36:29,967 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:29,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -448382176, now seen corresponding path program 1 times [2025-03-08 05:36:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988563296] [2025-03-08 05:36:29,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:29,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:36:29,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:36:29,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:29,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:30,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988563296] [2025-03-08 05:36:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988563296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:30,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:30,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:36:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103659500] [2025-03-08 05:36:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:30,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:36:30,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:30,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:36:30,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:30,033 INFO L87 Difference]: Start difference. First operand 47526 states and 81102 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:31,528 INFO L93 Difference]: Finished difference Result 88413 states and 151218 transitions. [2025-03-08 05:36:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:36:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 167 [2025-03-08 05:36:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:31,916 INFO L225 Difference]: With dead ends: 88413 [2025-03-08 05:36:31,917 INFO L226 Difference]: Without dead ends: 88257 [2025-03-08 05:36:31,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:36:31,965 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 76 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:31,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 772 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:36:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88257 states. [2025-03-08 05:36:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88257 to 88249. [2025-03-08 05:36:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88249 states, 72907 states have (on average 1.605785452700015) internal successors, (117073), 72913 states have internal predecessors, (117073), 15317 states have call successors, (15317), 22 states have call predecessors, (15317), 24 states have return successors, (17508), 15316 states have call predecessors, (17508), 15316 states have call successors, (17508) [2025-03-08 05:36:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88249 states to 88249 states and 149898 transitions. [2025-03-08 05:36:35,217 INFO L78 Accepts]: Start accepts. Automaton has 88249 states and 149898 transitions. Word has length 167 [2025-03-08 05:36:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:35,218 INFO L471 AbstractCegarLoop]: Abstraction has 88249 states and 149898 transitions. [2025-03-08 05:36:35,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 05:36:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 88249 states and 149898 transitions. [2025-03-08 05:36:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 05:36:35,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:35,377 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:35,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:36:35,378 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:35,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1314728707, now seen corresponding path program 1 times [2025-03-08 05:36:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747740293] [2025-03-08 05:36:35,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:35,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:36:35,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:36:35,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:35,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:36:35,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:35,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747740293] [2025-03-08 05:36:35,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747740293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:36:35,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762080846] [2025-03-08 05:36:35,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:35,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:35,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:36:35,604 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-08 05:36:35,606 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-08 05:36:35,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 05:36:35,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 05:36:35,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:35,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:35,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:36:35,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:36:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 55 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:36:36,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:36:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 05:36:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762080846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:36:37,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:36:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2025-03-08 05:36:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539798765] [2025-03-08 05:36:37,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:36:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 05:36:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:37,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 05:36:37,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:36:37,148 INFO L87 Difference]: Start difference. First operand 88249 states and 149898 transitions. Second operand has 32 states, 32 states have (on average 9.09375) internal successors, (291), 29 states have internal predecessors, (291), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) [2025-03-08 05:36:42,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:36:42,778 INFO L93 Difference]: Finished difference Result 176189 states and 304670 transitions. [2025-03-08 05:36:42,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 05:36:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 9.09375) internal successors, (291), 29 states have internal predecessors, (291), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) Word has length 168 [2025-03-08 05:36:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:36:43,693 INFO L225 Difference]: With dead ends: 176189 [2025-03-08 05:36:43,693 INFO L226 Difference]: Without dead ends: 176050 [2025-03-08 05:36:43,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=434, Invalid=2218, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 05:36:43,777 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1795 mSDsluCounter, 7978 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1798 SdHoareTripleChecker+Valid, 8594 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:36:43,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1798 Valid, 8594 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:36:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176050 states. [2025-03-08 05:36:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176050 to 175950. [2025-03-08 05:36:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175950 states, 145436 states have (on average 1.606534833191232) internal successors, (233648), 145343 states have internal predecessors, (233648), 30436 states have call successors, (30436), 69 states have call predecessors, (30436), 77 states have return successors, (38094), 30549 states have call predecessors, (38094), 30432 states have call successors, (38094) [2025-03-08 05:36:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175950 states to 175950 states and 302178 transitions. [2025-03-08 05:36:50,138 INFO L78 Accepts]: Start accepts. Automaton has 175950 states and 302178 transitions. Word has length 168 [2025-03-08 05:36:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:36:50,138 INFO L471 AbstractCegarLoop]: Abstraction has 175950 states and 302178 transitions. [2025-03-08 05:36:50,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.09375) internal successors, (291), 29 states have internal predecessors, (291), 17 states have call successors, (45), 5 states have call predecessors, (45), 13 states have return successors, (45), 19 states have call predecessors, (45), 17 states have call successors, (45) [2025-03-08 05:36:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 175950 states and 302178 transitions. [2025-03-08 05:36:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:36:51,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:36:51,127 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-08 05:36:51,134 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-08 05:36:51,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:36:51,328 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:36:51,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:36:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash 831684848, now seen corresponding path program 1 times [2025-03-08 05:36:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:36:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271364979] [2025-03-08 05:36:51,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:36:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:36:51,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:36:51,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:36:51,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:36:51,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:36:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:36:51,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:36:51,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271364979] [2025-03-08 05:36:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271364979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:36:51,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:36:51,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:36:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851718470] [2025-03-08 05:36:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:36:51,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:36:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:36:51,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:36:51,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:36:51,412 INFO L87 Difference]: Start difference. First operand 175950 states and 302178 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)