./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_product31.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 87743dcc2c25562bb963887f71637e8ebeccc1d21e21cc059ac68c446a3d9b4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:45:35,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:45:35,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:45:35,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:45:35,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:45:35,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:45:35,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:45:35,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:45:35,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:45:35,194 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:45:35,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:45:35,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:45:35,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:45:35,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:45:35,194 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:45:35,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:45:35,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:45:35,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:45:35,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:45:35,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:45:35,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:45:35,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:45:35,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:45:35,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:45:35,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:45:35,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:45:35,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:45:35,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:45:35,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:45:35,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:45:35,196 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-jdk21/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 -> 87743dcc2c25562bb963887f71637e8ebeccc1d21e21cc059ac68c446a3d9b4f [2025-02-05 15:45:35,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:45:35,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:45:35,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:45:35,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:45:35,435 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:45:35,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product31.cil.c [2025-02-05 15:45:36,659 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e833b6717/f7bb00dc77274dcbadd8e9ff4a3a9d83/FLAG1b172009c [2025-02-05 15:45:36,996 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:45:36,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product31.cil.c [2025-02-05 15:45:37,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e833b6717/f7bb00dc77274dcbadd8e9ff4a3a9d83/FLAG1b172009c [2025-02-05 15:45:37,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e833b6717/f7bb00dc77274dcbadd8e9ff4a3a9d83 [2025-02-05 15:45:37,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:45:37,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:45:37,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:45:37,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:45:37,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:45:37,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:37,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791212dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37, skipping insertion in model container [2025-02-05 15:45:37,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:37,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:45:37,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product31.cil.c[26985,26998] [2025-02-05 15:45:37,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:45:37,736 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:45:37,742 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-02-05 15:45:37,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1128] [2025-02-05 15:45:37,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1137] [2025-02-05 15:45:37,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1503] [2025-02-05 15:45:37,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1810] [2025-02-05 15:45:37,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2222] [2025-02-05 15:45:37,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2580] [2025-02-05 15:45:37,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2607] [2025-02-05 15:45:37,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2742] [2025-02-05 15:45:37,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2777] [2025-02-05 15:45:37,746 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2794] [2025-02-05 15:45:37,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product31.cil.c[26985,26998] [2025-02-05 15:45:37,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:45:37,887 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:45:37,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37 WrapperNode [2025-02-05 15:45:37,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:45:37,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:45:37,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:45:37,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:45:37,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:37,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:37,962 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1026 [2025-02-05 15:45:37,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:45:37,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:45:37,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:45:37,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:45:37,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:37,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:37,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:38,002 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-02-05 15:45:38,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:38,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:38,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:38,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:38,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:38,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:38,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:45:38,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:45:38,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:45:38,045 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:45:38,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (1/1) ... [2025-02-05 15:45:38,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:45:38,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:38,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:45:38,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:45:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:45:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:45:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:45:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:45:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:45:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:45:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:45:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:45:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:45:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:45:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:45:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:45:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:45:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:45:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:45:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:45:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:45:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:45:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:45:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:45:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:45:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:45:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:45:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:45:38,307 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:45:38,310 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:45:38,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2203-1: isVerified_#res#1 := isVerified_~retValue_acc~31#1; [2025-02-05 15:45:38,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-02-05 15:45:38,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866-1: getEmailId_#res#1 := getEmailId_~retValue_acc~22#1; [2025-02-05 15:45:38,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1058-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~15#1; [2025-02-05 15:45:38,561 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: #res := ~retValue_acc~29; [2025-02-05 15:45:38,571 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486: #res := ~retValue_acc~36; [2025-02-05 15:45:38,594 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2025-02-05 15:45:38,594 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-02-05 15:45:38,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~14; [2025-02-05 15:45:38,632 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2025-02-05 15:45:38,639 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739-1: createEmail_#res#1 := createEmail_~retValue_acc~40#1; [2025-02-05 15:45:38,649 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: #res := ~retValue_acc~27; [2025-02-05 15:45:38,660 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2092: #res := ~retValue_acc~28; [2025-02-05 15:45:38,665 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2166: #res := ~retValue_acc~30; [2025-02-05 15:45:38,685 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1940: #res := ~retValue_acc~24; [2025-02-05 15:45:38,976 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2443-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~33#1; [2025-02-05 15:45:38,976 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-02-05 15:45:38,977 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-02-05 15:45:38,977 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2774-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2025-02-05 15:45:38,977 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2452-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~34#1; [2025-02-05 15:45:38,977 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2461-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~35#1; [2025-02-05 15:45:38,987 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903: #res := ~retValue_acc~23; [2025-02-05 15:45:38,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2715: #res#1 := ~retValue_acc~38#1; [2025-02-05 15:45:38,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2695-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~37#1; [2025-02-05 15:45:39,101 INFO L? ?]: Removed 477 outVars from TransFormulas that were not future-live. [2025-02-05 15:45:39,101 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:45:39,111 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:45:39,111 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:45:39,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:45:39 BoogieIcfgContainer [2025-02-05 15:45:39,112 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:45:39,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:45:39,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:45:39,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:45:39,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:45:37" (1/3) ... [2025-02-05 15:45:39,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bed0ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:45:39, skipping insertion in model container [2025-02-05 15:45:39,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:45:37" (2/3) ... [2025-02-05 15:45:39,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bed0ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:45:39, skipping insertion in model container [2025-02-05 15:45:39,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:45:39" (3/3) ... [2025-02-05 15:45:39,119 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product31.cil.c [2025-02-05 15:45:39,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:45:39,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product31.cil.c that has 24 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:45:39,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:45:39,188 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;@2592e09b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:45:39,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:45:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 284 states have (on average 1.5) internal successors, (426), 288 states have internal predecessors, (426), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-05 15:45:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:45:39,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:39,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:39,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:39,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2030100056, now seen corresponding path program 1 times [2025-02-05 15:45:39,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:39,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282607968] [2025-02-05 15:45:39,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:39,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:39,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:45:39,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:45:39,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:39,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:45:39,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:39,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282607968] [2025-02-05 15:45:39,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282607968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:39,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785762430] [2025-02-05 15:45:39,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:39,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:39,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:39,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:45:39,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:45:40,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:45:40,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:40,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:40,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:45:40,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:45:40,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:40,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785762430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:40,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:40,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:45:40,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858446232] [2025-02-05 15:45:40,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:40,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:45:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:40,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:45:40,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:40,184 INFO L87 Difference]: Start difference. First operand has 368 states, 284 states have (on average 1.5) internal successors, (426), 288 states have internal predecessors, (426), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:40,244 INFO L93 Difference]: Finished difference Result 583 states and 844 transitions. [2025-02-05 15:45:40,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:45:40,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2025-02-05 15:45:40,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:40,259 INFO L225 Difference]: With dead ends: 583 [2025-02-05 15:45:40,259 INFO L226 Difference]: Without dead ends: 361 [2025-02-05 15:45:40,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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-02-05 15:45:40,265 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:40,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-05 15:45:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-02-05 15:45:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 278 states have (on average 1.4964028776978417) internal successors, (416), 281 states have internal predecessors, (416), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 15:45:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 533 transitions. [2025-02-05 15:45:40,317 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 533 transitions. Word has length 107 [2025-02-05 15:45:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:40,318 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 533 transitions. [2025-02-05 15:45:40,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 533 transitions. [2025-02-05 15:45:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:45:40,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:40,322 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:40,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:45:40,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:45:40,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:40,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1972937420, now seen corresponding path program 1 times [2025-02-05 15:45:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532272107] [2025-02-05 15:45:40,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:40,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:45:40,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:45:40,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:40,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:45:40,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:40,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532272107] [2025-02-05 15:45:40,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532272107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:40,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608691283] [2025-02-05 15:45:40,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:40,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:40,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:40,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:40,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:45:40,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:45:41,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:45:41,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:41,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:41,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:45:41,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:45:41,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608691283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:41,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:41,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:45:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109764550] [2025-02-05 15:45:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:41,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:41,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:41,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:45:41,064 INFO L87 Difference]: Start difference. First operand 361 states and 533 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:41,102 INFO L93 Difference]: Finished difference Result 572 states and 825 transitions. [2025-02-05 15:45:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2025-02-05 15:45:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:41,105 INFO L225 Difference]: With dead ends: 572 [2025-02-05 15:45:41,105 INFO L226 Difference]: Without dead ends: 363 [2025-02-05 15:45:41,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 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-02-05 15:45:41,110 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:41,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1062 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-05 15:45:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-02-05 15:45:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 280 states have (on average 1.4928571428571429) internal successors, (418), 283 states have internal predecessors, (418), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 15:45:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 535 transitions. [2025-02-05 15:45:41,130 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 535 transitions. Word has length 108 [2025-02-05 15:45:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:41,131 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 535 transitions. [2025-02-05 15:45:41,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 535 transitions. [2025-02-05 15:45:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:45:41,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:41,133 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:41,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:45:41,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:41,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:41,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash 723998243, now seen corresponding path program 1 times [2025-02-05 15:45:41,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:41,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20160141] [2025-02-05 15:45:41,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:41,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:45:41,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:45:41,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:41,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:45:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:41,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20160141] [2025-02-05 15:45:41,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20160141] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:41,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775070703] [2025-02-05 15:45:41,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:41,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:41,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:41,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:41,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:45:41,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:45:41,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:45:41,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:41,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:41,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:45:41,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:45:41,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775070703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:41,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:41,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:45:41,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840033234] [2025-02-05 15:45:41,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:41,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:41,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:41,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:45:41,828 INFO L87 Difference]: Start difference. First operand 363 states and 535 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:41,859 INFO L93 Difference]: Finished difference Result 755 states and 1128 transitions. [2025-02-05 15:45:41,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:41,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2025-02-05 15:45:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:41,863 INFO L225 Difference]: With dead ends: 755 [2025-02-05 15:45:41,863 INFO L226 Difference]: Without dead ends: 419 [2025-02-05 15:45:41,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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-02-05 15:45:41,865 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 107 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1027 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-02-05 15:45:41,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1027 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-05 15:45:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2025-02-05 15:45:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 317 states have (on average 1.5110410094637223) internal successors, (479), 320 states have internal predecessors, (479), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-05 15:45:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2025-02-05 15:45:41,889 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 113 [2025-02-05 15:45:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:41,889 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2025-02-05 15:45:41,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2025-02-05 15:45:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:45:41,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:41,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:41,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:45:42,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:42,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:42,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1255236049, now seen corresponding path program 1 times [2025-02-05 15:45:42,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:42,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130752913] [2025-02-05 15:45:42,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:42,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:45:42,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:45:42,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:42,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:45:42,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130752913] [2025-02-05 15:45:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130752913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588270885] [2025-02-05 15:45:42,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:42,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:42,260 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:45:42,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:45:42,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:45:42,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:42,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:42,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:45:42,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:45:42,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588270885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:42,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:45:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809851110] [2025-02-05 15:45:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:42,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:42,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:42,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:42,675 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:45:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:42,762 INFO L93 Difference]: Finished difference Result 813 states and 1226 transitions. [2025-02-05 15:45:42,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:42,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2025-02-05 15:45:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:42,767 INFO L225 Difference]: With dead ends: 813 [2025-02-05 15:45:42,768 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 15:45:42,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 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-02-05 15:45:42,770 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2089 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-02-05 15:45:42,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2089 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 15:45:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-05 15:45:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 318 states have (on average 1.509433962264151) internal successors, (480), 322 states have internal predecessors, (480), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2025-02-05 15:45:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2025-02-05 15:45:42,807 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 114 [2025-02-05 15:45:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:42,808 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2025-02-05 15:45:42,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:45:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2025-02-05 15:45:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:45:42,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:42,811 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:42,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:45:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:43,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:43,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:43,014 INFO L85 PathProgramCache]: Analyzing trace with hash -58337571, now seen corresponding path program 1 times [2025-02-05 15:45:43,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:43,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522459375] [2025-02-05 15:45:43,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:43,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:45:43,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:45:43,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:43,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:45:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522459375] [2025-02-05 15:45:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522459375] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192375773] [2025-02-05 15:45:43,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:43,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:43,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:43,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:43,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:45:43,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:45:43,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:45:43,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:43,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:43,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:45:43,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:45:43,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192375773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:43,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:45:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089443792] [2025-02-05 15:45:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:43,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:43,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:43,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:45:43,465 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:45:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:43,541 INFO L93 Difference]: Finished difference Result 815 states and 1231 transitions. [2025-02-05 15:45:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:43,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-02-05 15:45:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:43,544 INFO L225 Difference]: With dead ends: 815 [2025-02-05 15:45:43,545 INFO L226 Difference]: Without dead ends: 415 [2025-02-05 15:45:43,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 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-02-05 15:45:43,547 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 2 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2075 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-02-05 15:45:43,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2075 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-05 15:45:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-02-05 15:45:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2025-02-05 15:45:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 627 transitions. [2025-02-05 15:45:43,563 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 627 transitions. Word has length 115 [2025-02-05 15:45:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:43,563 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 627 transitions. [2025-02-05 15:45:43,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:45:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 627 transitions. [2025-02-05 15:45:43,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:45:43,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:43,569 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:43,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:45:43,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:43,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:43,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash -647549053, now seen corresponding path program 1 times [2025-02-05 15:45:43,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:43,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128080629] [2025-02-05 15:45:43,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:43,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:43,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:45:43,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:45:43,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:43,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:45:43,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:43,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128080629] [2025-02-05 15:45:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128080629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:43,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:43,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:45:43,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992993556] [2025-02-05 15:45:43,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:43,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:43,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:43,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:43,908 INFO L87 Difference]: Start difference. First operand 415 states and 627 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:45:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:43,951 INFO L93 Difference]: Finished difference Result 807 states and 1222 transitions. [2025-02-05 15:45:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:43,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-02-05 15:45:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:43,955 INFO L225 Difference]: With dead ends: 807 [2025-02-05 15:45:43,955 INFO L226 Difference]: Without dead ends: 415 [2025-02-05 15:45:43,956 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-02-05 15:45:43,957 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2093 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-02-05 15:45:43,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2093 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-05 15:45:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-02-05 15:45:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2025-02-05 15:45:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 626 transitions. [2025-02-05 15:45:43,978 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 626 transitions. Word has length 116 [2025-02-05 15:45:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:43,978 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 626 transitions. [2025-02-05 15:45:43,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:45:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 626 transitions. [2025-02-05 15:45:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:45:43,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:43,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:43,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:45:43,984 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2146692307, now seen corresponding path program 2 times [2025-02-05 15:45:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:43,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441978619] [2025-02-05 15:45:43,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:45:43,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:44,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-02-05 15:45:44,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 117 statements. [2025-02-05 15:45:44,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:45:44,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:45:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441978619] [2025-02-05 15:45:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441978619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:44,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:45:44,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002363253] [2025-02-05 15:45:44,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:44,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:45:44,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:44,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:45:44,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:44,153 INFO L87 Difference]: Start difference. First operand 415 states and 626 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:44,495 INFO L93 Difference]: Finished difference Result 839 states and 1276 transitions. [2025-02-05 15:45:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:45:44,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-02-05 15:45:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:44,503 INFO L225 Difference]: With dead ends: 839 [2025-02-05 15:45:44,503 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 15:45:44,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:45:44,504 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 888 mSDsluCounter, 2564 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:44,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 3111 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:45:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 15:45:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 825. [2025-02-05 15:45:44,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 636 states have (on average 1.5125786163522013) internal successors, (962), 643 states have internal predecessors, (962), 138 states have call successors, (138), 47 states have call predecessors, (138), 50 states have return successors, (153), 138 states have call predecessors, (153), 136 states have call successors, (153) [2025-02-05 15:45:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1253 transitions. [2025-02-05 15:45:44,544 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1253 transitions. Word has length 117 [2025-02-05 15:45:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:44,545 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1253 transitions. [2025-02-05 15:45:44,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1253 transitions. [2025-02-05 15:45:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:45:44,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:44,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:44,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:45:44,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:44,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:44,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1777377102, now seen corresponding path program 1 times [2025-02-05 15:45:44,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:44,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358432081] [2025-02-05 15:45:44,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:44,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:45:44,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:45:44,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:44,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:45:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358432081] [2025-02-05 15:45:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358432081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:44,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:44,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:45:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333035209] [2025-02-05 15:45:44,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:44,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:44,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:44,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:44,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:45:44,691 INFO L87 Difference]: Start difference. First operand 825 states and 1253 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:45:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:44,741 INFO L93 Difference]: Finished difference Result 1619 states and 2466 transitions. [2025-02-05 15:45:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:44,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-02-05 15:45:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:44,747 INFO L225 Difference]: With dead ends: 1619 [2025-02-05 15:45:44,747 INFO L226 Difference]: Without dead ends: 829 [2025-02-05 15:45:44,750 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-02-05 15:45:44,750 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2096 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-02-05 15:45:44,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2096 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-02-05 15:45:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2025-02-05 15:45:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 638 states have (on average 1.5109717868338557) internal successors, (964), 647 states have internal predecessors, (964), 138 states have call successors, (138), 47 states have call predecessors, (138), 52 states have return successors, (156), 138 states have call predecessors, (156), 136 states have call successors, (156) [2025-02-05 15:45:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1258 transitions. [2025-02-05 15:45:44,789 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1258 transitions. Word has length 118 [2025-02-05 15:45:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:44,789 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1258 transitions. [2025-02-05 15:45:44,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:45:44,791 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1258 transitions. [2025-02-05 15:45:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:45:44,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:44,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:44,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:45:44,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:44,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:44,795 INFO L85 PathProgramCache]: Analyzing trace with hash 308829563, now seen corresponding path program 1 times [2025-02-05 15:45:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:44,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272188477] [2025-02-05 15:45:44,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:44,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:45:44,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:45:44,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:44,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:45:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272188477] [2025-02-05 15:45:44,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272188477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:44,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:44,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:45:44,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006427986] [2025-02-05 15:45:44,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:44,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:45:44,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:44,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:45:44,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:44,918 INFO L87 Difference]: Start difference. First operand 829 states and 1258 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:45:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:45,042 INFO L93 Difference]: Finished difference Result 1617 states and 2458 transitions. [2025-02-05 15:45:45,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:45:45,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2025-02-05 15:45:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:45,048 INFO L225 Difference]: With dead ends: 1617 [2025-02-05 15:45:45,048 INFO L226 Difference]: Without dead ends: 833 [2025-02-05 15:45:45,051 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-02-05 15:45:45,051 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 7 mSDsluCounter, 3073 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:45,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3590 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:45:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-05 15:45:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 831. [2025-02-05 15:45:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 640 states have (on average 1.509375) internal successors, (966), 648 states have internal predecessors, (966), 138 states have call successors, (138), 48 states have call predecessors, (138), 52 states have return successors, (154), 138 states have call predecessors, (154), 136 states have call successors, (154) [2025-02-05 15:45:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1258 transitions. [2025-02-05 15:45:45,085 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1258 transitions. Word has length 119 [2025-02-05 15:45:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:45,085 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1258 transitions. [2025-02-05 15:45:45,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:45:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1258 transitions. [2025-02-05 15:45:45,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:45:45,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:45,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:45,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:45:45,088 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1119340349, now seen corresponding path program 2 times [2025-02-05 15:45:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062933614] [2025-02-05 15:45:45,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:45:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:45,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-02-05 15:45:45,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 120 statements. [2025-02-05 15:45:45,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:45:45,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:45:45,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:45,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062933614] [2025-02-05 15:45:45,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062933614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:45,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:45,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:45:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319960243] [2025-02-05 15:45:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:45,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:45:45,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:45,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:45:45,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:45,211 INFO L87 Difference]: Start difference. First operand 831 states and 1258 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:45,601 INFO L93 Difference]: Finished difference Result 1659 states and 2540 transitions. [2025-02-05 15:45:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:45:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-02-05 15:45:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:45,611 INFO L225 Difference]: With dead ends: 1659 [2025-02-05 15:45:45,612 INFO L226 Difference]: Without dead ends: 1657 [2025-02-05 15:45:45,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:45:45,614 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 481 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:45,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 3514 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:45:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-02-05 15:45:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1633. [2025-02-05 15:45:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1261 states have (on average 1.5154639175257731) internal successors, (1911), 1278 states have internal predecessors, (1911), 266 states have call successors, (266), 94 states have call predecessors, (266), 105 states have return successors, (321), 268 states have call predecessors, (321), 262 states have call successors, (321) [2025-02-05 15:45:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2498 transitions. [2025-02-05 15:45:45,687 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2498 transitions. Word has length 120 [2025-02-05 15:45:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:45,688 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2498 transitions. [2025-02-05 15:45:45,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2498 transitions. [2025-02-05 15:45:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:45:45,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:45,693 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:45,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:45:45,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:45,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:45,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1578585766, now seen corresponding path program 1 times [2025-02-05 15:45:45,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:45,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439250493] [2025-02-05 15:45:45,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:45,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:45,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:45:45,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:45:45,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:45,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:45:45,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439250493] [2025-02-05 15:45:45,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439250493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654862894] [2025-02-05 15:45:45,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:45,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:45,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:45,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:45,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:45:45,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:45:46,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:45:46,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:46,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:46,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:45:46,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:45:46,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:45:46,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654862894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:46,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:45:46,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:45:46,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425302982] [2025-02-05 15:45:46,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:46,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:45:46,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:46,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:45:46,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:46,099 INFO L87 Difference]: Start difference. First operand 1633 states and 2498 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:46,183 INFO L93 Difference]: Finished difference Result 2467 states and 3765 transitions. [2025-02-05 15:45:46,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:45:46,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2025-02-05 15:45:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:46,193 INFO L225 Difference]: With dead ends: 2467 [2025-02-05 15:45:46,193 INFO L226 Difference]: Without dead ends: 1647 [2025-02-05 15:45:46,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 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-02-05 15:45:46,197 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 1 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:46,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2086 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:46,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-02-05 15:45:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1635. [2025-02-05 15:45:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1262 states have (on average 1.515055467511886) internal successors, (1912), 1280 states have internal predecessors, (1912), 266 states have call successors, (266), 94 states have call predecessors, (266), 106 states have return successors, (323), 268 states have call predecessors, (323), 262 states have call successors, (323) [2025-02-05 15:45:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2501 transitions. [2025-02-05 15:45:46,259 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2501 transitions. Word has length 120 [2025-02-05 15:45:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:46,259 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2501 transitions. [2025-02-05 15:45:46,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2501 transitions. [2025-02-05 15:45:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:45:46,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:46,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:46,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:45:46,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:45:46,466 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:46,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1772574726, now seen corresponding path program 1 times [2025-02-05 15:45:46,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:46,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356202309] [2025-02-05 15:45:46,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:46,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:46,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:45:46,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:45:46,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:46,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:45:46,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:46,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356202309] [2025-02-05 15:45:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356202309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:46,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:45:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664825111] [2025-02-05 15:45:46,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:46,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:45:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:46,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:45:46,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:45:46,611 INFO L87 Difference]: Start difference. First operand 1635 states and 2501 transitions. Second operand has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:45:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:46,739 INFO L93 Difference]: Finished difference Result 2429 states and 3710 transitions. [2025-02-05 15:45:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:45:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 121 [2025-02-05 15:45:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:46,744 INFO L225 Difference]: With dead ends: 2429 [2025-02-05 15:45:46,744 INFO L226 Difference]: Without dead ends: 843 [2025-02-05 15:45:46,749 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-02-05 15:45:46,749 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 5 mSDsluCounter, 3085 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3604 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:46,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3604 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:45:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-02-05 15:45:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 841. [2025-02-05 15:45:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 647 states have (on average 1.5038639876352395) internal successors, (973), 657 states have internal predecessors, (973), 138 states have call successors, (138), 49 states have call predecessors, (138), 55 states have return successors, (163), 138 states have call predecessors, (163), 136 states have call successors, (163) [2025-02-05 15:45:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1274 transitions. [2025-02-05 15:45:46,778 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1274 transitions. Word has length 121 [2025-02-05 15:45:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:46,778 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1274 transitions. [2025-02-05 15:45:46,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:45:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1274 transitions. [2025-02-05 15:45:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:45:46,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:46,781 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:46,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:45:46,781 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:46,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash -350129922, now seen corresponding path program 1 times [2025-02-05 15:45:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:46,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470108623] [2025-02-05 15:45:46,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:45:46,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:45:46,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:46,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:46,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470108623] [2025-02-05 15:45:46,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470108623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:46,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313280182] [2025-02-05 15:45:46,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:46,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:46,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:46,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:46,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:45:47,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:45:47,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:45:47,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:47,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:47,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:45:47,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:47,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:45:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:47,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313280182] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:45:47,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:45:47,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:45:47,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765536198] [2025-02-05 15:45:47,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:45:47,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:45:47,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:47,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:45:47,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:45:47,195 INFO L87 Difference]: Start difference. First operand 841 states and 1274 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:45:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:47,320 INFO L93 Difference]: Finished difference Result 1955 states and 3070 transitions. [2025-02-05 15:45:47,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:45:47,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 121 [2025-02-05 15:45:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:47,330 INFO L225 Difference]: With dead ends: 1955 [2025-02-05 15:45:47,330 INFO L226 Difference]: Without dead ends: 1535 [2025-02-05 15:45:47,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 239 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-02-05 15:45:47,334 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 315 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:47,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 2766 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:45:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-02-05 15:45:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1487. [2025-02-05 15:45:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1165 states have (on average 1.578540772532189) internal successors, (1839), 1175 states have internal predecessors, (1839), 266 states have call successors, (266), 49 states have call predecessors, (266), 55 states have return successors, (316), 266 states have call predecessors, (316), 264 states have call successors, (316) [2025-02-05 15:45:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2421 transitions. [2025-02-05 15:45:47,408 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2421 transitions. Word has length 121 [2025-02-05 15:45:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:47,410 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2421 transitions. [2025-02-05 15:45:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:45:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2421 transitions. [2025-02-05 15:45:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:45:47,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:47,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:47,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:45:47,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:47,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:47,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1894485026, now seen corresponding path program 1 times [2025-02-05 15:45:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:47,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359485426] [2025-02-05 15:45:47,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:47,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:47,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:45:47,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:45:47,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:47,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:47,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:47,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359485426] [2025-02-05 15:45:47,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359485426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:47,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:47,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:47,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797115327] [2025-02-05 15:45:47,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:47,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:47,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:47,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:47,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:47,681 INFO L87 Difference]: Start difference. First operand 1487 states and 2421 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:47,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:47,731 INFO L93 Difference]: Finished difference Result 3503 states and 5795 transitions. [2025-02-05 15:45:47,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:47,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2025-02-05 15:45:47,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:47,743 INFO L225 Difference]: With dead ends: 3503 [2025-02-05 15:45:47,744 INFO L226 Difference]: Without dead ends: 2143 [2025-02-05 15:45:47,749 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-02-05 15:45:47,750 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 105 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1077 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-02-05 15:45:47,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1077 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:47,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2025-02-05 15:45:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2127. [2025-02-05 15:45:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 1677 states have (on average 1.5974955277280858) internal successors, (2679), 1687 states have internal predecessors, (2679), 394 states have call successors, (394), 49 states have call predecessors, (394), 55 states have return successors, (469), 394 states have call predecessors, (469), 392 states have call successors, (469) [2025-02-05 15:45:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3542 transitions. [2025-02-05 15:45:47,836 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3542 transitions. Word has length 127 [2025-02-05 15:45:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:47,836 INFO L471 AbstractCegarLoop]: Abstraction has 2127 states and 3542 transitions. [2025-02-05 15:45:47,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3542 transitions. [2025-02-05 15:45:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:45:47,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:47,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:47,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:45:47,846 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:47,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1932447333, now seen corresponding path program 1 times [2025-02-05 15:45:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:47,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101052401] [2025-02-05 15:45:47,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:47,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:45:47,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:45:47,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:47,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:47,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:47,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101052401] [2025-02-05 15:45:47,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101052401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:47,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:47,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:47,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978578132] [2025-02-05 15:45:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:47,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:47,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:47,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:47,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:47,900 INFO L87 Difference]: Start difference. First operand 2127 states and 3542 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:47,995 INFO L93 Difference]: Finished difference Result 5041 states and 8464 transitions. [2025-02-05 15:45:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-02-05 15:45:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:48,012 INFO L225 Difference]: With dead ends: 5041 [2025-02-05 15:45:48,013 INFO L226 Difference]: Without dead ends: 3143 [2025-02-05 15:45:48,021 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-02-05 15:45:48,021 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 103 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1068 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-02-05 15:45:48,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1068 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2025-02-05 15:45:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3127. [2025-02-05 15:45:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 2487 states have (on average 1.6103739445114595) internal successors, (4005), 2497 states have internal predecessors, (4005), 584 states have call successors, (584), 49 states have call predecessors, (584), 55 states have return successors, (675), 584 states have call predecessors, (675), 582 states have call successors, (675) [2025-02-05 15:45:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 5264 transitions. [2025-02-05 15:45:48,141 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 5264 transitions. Word has length 128 [2025-02-05 15:45:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:48,142 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 5264 transitions. [2025-02-05 15:45:48,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:48,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 5264 transitions. [2025-02-05 15:45:48,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:45:48,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:48,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:48,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:45:48,158 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:48,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash 590647869, now seen corresponding path program 1 times [2025-02-05 15:45:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:48,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271074053] [2025-02-05 15:45:48,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:48,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:48,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:45:48,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:45:48,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:48,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:48,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:48,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271074053] [2025-02-05 15:45:48,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271074053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:48,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:48,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:48,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172034227] [2025-02-05 15:45:48,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:48,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:48,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:48,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:48,234 INFO L87 Difference]: Start difference. First operand 3127 states and 5264 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:48,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:48,375 INFO L93 Difference]: Finished difference Result 7309 states and 12412 transitions. [2025-02-05 15:45:48,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:48,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-02-05 15:45:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:48,402 INFO L225 Difference]: With dead ends: 7309 [2025-02-05 15:45:48,403 INFO L226 Difference]: Without dead ends: 4655 [2025-02-05 15:45:48,415 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-02-05 15:45:48,415 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 101 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1055 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-02-05 15:45:48,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2025-02-05 15:45:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4639. [2025-02-05 15:45:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4639 states, 3753 states have (on average 1.6203037569944045) internal successors, (6081), 3763 states have internal predecessors, (6081), 830 states have call successors, (830), 49 states have call predecessors, (830), 55 states have return successors, (971), 830 states have call predecessors, (971), 828 states have call successors, (971) [2025-02-05 15:45:48,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 7882 transitions. [2025-02-05 15:45:48,612 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 7882 transitions. Word has length 129 [2025-02-05 15:45:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:48,612 INFO L471 AbstractCegarLoop]: Abstraction has 4639 states and 7882 transitions. [2025-02-05 15:45:48,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 7882 transitions. [2025-02-05 15:45:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:45:48,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:48,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:48,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:45:48,634 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:48,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash 325386662, now seen corresponding path program 1 times [2025-02-05 15:45:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:48,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536835652] [2025-02-05 15:45:48,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:48,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:45:48,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:45:48,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:48,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536835652] [2025-02-05 15:45:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536835652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:48,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505881033] [2025-02-05 15:45:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:48,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:48,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:48,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:48,684 INFO L87 Difference]: Start difference. First operand 4639 states and 7882 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:48,859 INFO L93 Difference]: Finished difference Result 10835 states and 18556 transitions. [2025-02-05 15:45:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:48,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-02-05 15:45:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:48,911 INFO L225 Difference]: With dead ends: 10835 [2025-02-05 15:45:48,911 INFO L226 Difference]: Without dead ends: 7069 [2025-02-05 15:45:48,927 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-02-05 15:45:48,928 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 99 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1055 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-02-05 15:45:48,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7069 states. [2025-02-05 15:45:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7069 to 7053. [2025-02-05 15:45:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7053 states, 5809 states have (on average 1.6269581683594423) internal successors, (9451), 5819 states have internal predecessors, (9451), 1188 states have call successors, (1188), 49 states have call predecessors, (1188), 55 states have return successors, (1412), 1188 states have call predecessors, (1412), 1186 states have call successors, (1412) [2025-02-05 15:45:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7053 states to 7053 states and 12051 transitions. [2025-02-05 15:45:49,232 INFO L78 Accepts]: Start accepts. Automaton has 7053 states and 12051 transitions. Word has length 130 [2025-02-05 15:45:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:49,233 INFO L471 AbstractCegarLoop]: Abstraction has 7053 states and 12051 transitions. [2025-02-05 15:45:49,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 7053 states and 12051 transitions. [2025-02-05 15:45:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:45:49,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:49,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:49,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:45:49,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:49,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:49,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1235615300, now seen corresponding path program 1 times [2025-02-05 15:45:49,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:49,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283212497] [2025-02-05 15:45:49,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:49,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:49,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:45:49,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:45:49,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:49,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:49,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:49,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283212497] [2025-02-05 15:45:49,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283212497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:49,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:49,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533811140] [2025-02-05 15:45:49,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:49,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:49,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:49,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:49,306 INFO L87 Difference]: Start difference. First operand 7053 states and 12051 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:49,552 INFO L93 Difference]: Finished difference Result 16619 states and 28629 transitions. [2025-02-05 15:45:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:49,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-02-05 15:45:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:49,597 INFO L225 Difference]: With dead ends: 16619 [2025-02-05 15:45:49,597 INFO L226 Difference]: Without dead ends: 11053 [2025-02-05 15:45:49,621 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-02-05 15:45:49,622 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 97 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1066 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-02-05 15:45:49,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1066 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11053 states. [2025-02-05 15:45:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11053 to 11037. [2025-02-05 15:45:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11037 states, 9041 states have (on average 1.6233823692069462) internal successors, (14677), 9051 states have internal predecessors, (14677), 1940 states have call successors, (1940), 49 states have call predecessors, (1940), 55 states have return successors, (2308), 1940 states have call predecessors, (2308), 1938 states have call successors, (2308) [2025-02-05 15:45:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11037 states to 11037 states and 18925 transitions. [2025-02-05 15:45:50,182 INFO L78 Accepts]: Start accepts. Automaton has 11037 states and 18925 transitions. Word has length 131 [2025-02-05 15:45:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:50,183 INFO L471 AbstractCegarLoop]: Abstraction has 11037 states and 18925 transitions. [2025-02-05 15:45:50,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11037 states and 18925 transitions. [2025-02-05 15:45:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:45:50,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:50,224 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:50,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:45:50,225 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -948770073, now seen corresponding path program 1 times [2025-02-05 15:45:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981750010] [2025-02-05 15:45:50,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:50,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:45:50,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:45:50,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:50,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:50,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:50,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981750010] [2025-02-05 15:45:50,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981750010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:50,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:50,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851511450] [2025-02-05 15:45:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:50,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:50,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:50,283 INFO L87 Difference]: Start difference. First operand 11037 states and 18925 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:50,771 INFO L93 Difference]: Finished difference Result 27083 states and 46711 transitions. [2025-02-05 15:45:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-02-05 15:45:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:50,874 INFO L225 Difference]: With dead ends: 27083 [2025-02-05 15:45:50,875 INFO L226 Difference]: Without dead ends: 18275 [2025-02-05 15:45:50,912 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-02-05 15:45:50,913 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 95 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1068 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-02-05 15:45:50,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1068 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18275 states. [2025-02-05 15:45:51,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18275 to 18259. [2025-02-05 15:45:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18259 states, 15051 states have (on average 1.6228157597501827) internal successors, (24425), 15061 states have internal predecessors, (24425), 3152 states have call successors, (3152), 49 states have call predecessors, (3152), 55 states have return successors, (3709), 3152 states have call predecessors, (3709), 3150 states have call successors, (3709) [2025-02-05 15:45:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18259 states to 18259 states and 31286 transitions. [2025-02-05 15:45:51,627 INFO L78 Accepts]: Start accepts. Automaton has 18259 states and 31286 transitions. Word has length 132 [2025-02-05 15:45:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:51,627 INFO L471 AbstractCegarLoop]: Abstraction has 18259 states and 31286 transitions. [2025-02-05 15:45:51,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 18259 states and 31286 transitions. [2025-02-05 15:45:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:45:51,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:51,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:51,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:45:51,671 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 775701339, now seen corresponding path program 1 times [2025-02-05 15:45:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234204315] [2025-02-05 15:45:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:51,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:45:51,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:45:51,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:51,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:51,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234204315] [2025-02-05 15:45:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234204315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:51,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:51,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055591424] [2025-02-05 15:45:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:51,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:51,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:51,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:51,719 INFO L87 Difference]: Start difference. First operand 18259 states and 31286 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:52,458 INFO L93 Difference]: Finished difference Result 47047 states and 81013 transitions. [2025-02-05 15:45:52,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:52,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-02-05 15:45:52,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:52,637 INFO L225 Difference]: With dead ends: 47047 [2025-02-05 15:45:52,637 INFO L226 Difference]: Without dead ends: 31907 [2025-02-05 15:45:52,696 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-02-05 15:45:52,699 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 93 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1085 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-02-05 15:45:52,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1085 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31907 states. [2025-02-05 15:45:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31907 to 31891. [2025-02-05 15:45:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31891 states, 26277 states have (on average 1.6149103778970202) internal successors, (42435), 26287 states have internal predecessors, (42435), 5558 states have call successors, (5558), 49 states have call predecessors, (5558), 55 states have return successors, (6540), 5558 states have call predecessors, (6540), 5556 states have call successors, (6540) [2025-02-05 15:45:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31891 states to 31891 states and 54533 transitions. [2025-02-05 15:45:54,119 INFO L78 Accepts]: Start accepts. Automaton has 31891 states and 54533 transitions. Word has length 133 [2025-02-05 15:45:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:54,119 INFO L471 AbstractCegarLoop]: Abstraction has 31891 states and 54533 transitions. [2025-02-05 15:45:54,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 31891 states and 54533 transitions. [2025-02-05 15:45:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:45:54,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:54,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:54,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:45:54,185 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:54,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2115824728, now seen corresponding path program 1 times [2025-02-05 15:45:54,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:54,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966178895] [2025-02-05 15:45:54,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:54,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:45:54,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:45:54,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:54,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966178895] [2025-02-05 15:45:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966178895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958465422] [2025-02-05 15:45:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:54,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:54,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:54,242 INFO L87 Difference]: Start difference. First operand 31891 states and 54533 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:55,185 INFO L93 Difference]: Finished difference Result 84189 states and 144744 transitions. [2025-02-05 15:45:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:55,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-02-05 15:45:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:55,465 INFO L225 Difference]: With dead ends: 84189 [2025-02-05 15:45:55,465 INFO L226 Difference]: Without dead ends: 56685 [2025-02-05 15:45:55,558 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-02-05 15:45:55,559 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 91 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1058 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-02-05 15:45:55,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1058 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56685 states. [2025-02-05 15:45:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56685 to 56669. [2025-02-05 15:45:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56669 states, 46977 states have (on average 1.6116610256082764) internal successors, (75711), 46987 states have internal predecessors, (75711), 9636 states have call successors, (9636), 49 states have call predecessors, (9636), 55 states have return successors, (11432), 9636 states have call predecessors, (11432), 9634 states have call successors, (11432) [2025-02-05 15:45:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56669 states to 56669 states and 96779 transitions. [2025-02-05 15:45:58,043 INFO L78 Accepts]: Start accepts. Automaton has 56669 states and 96779 transitions. Word has length 134 [2025-02-05 15:45:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:58,043 INFO L471 AbstractCegarLoop]: Abstraction has 56669 states and 96779 transitions. [2025-02-05 15:45:58,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:45:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 56669 states and 96779 transitions. [2025-02-05 15:45:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:45:58,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:58,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:45:58,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:45:58,175 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:58,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash 371389466, now seen corresponding path program 1 times [2025-02-05 15:45:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:58,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922667134] [2025-02-05 15:45:58,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:58,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:45:58,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:45:58,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:58,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:45:58,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:58,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922667134] [2025-02-05 15:45:58,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922667134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:58,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:58,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:58,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744419869] [2025-02-05 15:45:58,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:58,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:58,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:58,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:58,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:58,252 INFO L87 Difference]: Start difference. First operand 56669 states and 96779 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:46:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:00,543 INFO L93 Difference]: Finished difference Result 154153 states and 263858 transitions. [2025-02-05 15:46:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:00,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-02-05 15:46:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:01,039 INFO L225 Difference]: With dead ends: 154153 [2025-02-05 15:46:01,040 INFO L226 Difference]: Without dead ends: 103397 [2025-02-05 15:46:01,183 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-02-05 15:46:01,185 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 89 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1059 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-02-05 15:46:01,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1059 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103397 states. [2025-02-05 15:46:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103397 to 103381. [2025-02-05 15:46:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103381 states, 86259 states have (on average 1.6068236357945258) internal successors, (138603), 86269 states have internal predecessors, (138603), 17066 states have call successors, (17066), 49 states have call predecessors, (17066), 55 states have return successors, (19926), 17066 states have call predecessors, (19926), 17064 states have call successors, (19926) [2025-02-05 15:46:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103381 states to 103381 states and 175595 transitions. [2025-02-05 15:46:05,055 INFO L78 Accepts]: Start accepts. Automaton has 103381 states and 175595 transitions. Word has length 135 [2025-02-05 15:46:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:05,056 INFO L471 AbstractCegarLoop]: Abstraction has 103381 states and 175595 transitions. [2025-02-05 15:46:05,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:46:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 103381 states and 175595 transitions. [2025-02-05 15:46:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:46:05,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:05,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:05,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:46:05,149 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 626880777, now seen corresponding path program 1 times [2025-02-05 15:46:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:05,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415386012] [2025-02-05 15:46:05,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:05,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:46:05,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:46:05,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:05,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415386012] [2025-02-05 15:46:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415386012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158997133] [2025-02-05 15:46:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:05,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:05,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:05,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:05,198 INFO L87 Difference]: Start difference. First operand 103381 states and 175595 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:46:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:08,575 INFO L93 Difference]: Finished difference Result 192669 states and 328065 transitions. [2025-02-05 15:46:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:08,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-02-05 15:46:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:09,456 INFO L225 Difference]: With dead ends: 192669 [2025-02-05 15:46:09,456 INFO L226 Difference]: Without dead ends: 192249 [2025-02-05 15:46:09,525 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-02-05 15:46:09,525 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 84 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1072 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-02-05 15:46:09,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1072 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:09,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192249 states. [2025-02-05 15:46:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192249 to 192233. [2025-02-05 15:46:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192233 states, 161513 states have (on average 1.6003479596069665) internal successors, (258477), 161523 states have internal predecessors, (258477), 30664 states have call successors, (30664), 49 states have call predecessors, (30664), 55 states have return successors, (36139), 30664 states have call predecessors, (36139), 30662 states have call successors, (36139) [2025-02-05 15:46:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192233 states to 192233 states and 325280 transitions. [2025-02-05 15:46:16,212 INFO L78 Accepts]: Start accepts. Automaton has 192233 states and 325280 transitions. Word has length 136 [2025-02-05 15:46:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:16,213 INFO L471 AbstractCegarLoop]: Abstraction has 192233 states and 325280 transitions. [2025-02-05 15:46:16,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:46:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 192233 states and 325280 transitions. [2025-02-05 15:46:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:46:16,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:16,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:46:16,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:46:16,331 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:16,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1253163879, now seen corresponding path program 1 times [2025-02-05 15:46:16,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:16,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674104523] [2025-02-05 15:46:16,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:16,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:16,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:46:16,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:46:16,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:16,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:16,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:16,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674104523] [2025-02-05 15:46:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674104523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:16,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:46:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845792283] [2025-02-05 15:46:16,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:16,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:46:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:16,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:46:16,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:46:16,570 INFO L87 Difference]: Start difference. First operand 192233 states and 325280 transitions. Second operand has 14 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 6 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14)