./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_product33.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 7d58750164873693a8e41f270259eb299f067753793be4bdf6f5449bb7376f85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:54:39,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:54:39,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:54:39,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:54:39,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:54:39,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:54:39,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:54:39,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:54:39,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:54:39,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:54:39,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:54:39,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:54:39,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:54:39,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:39,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:39,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:54:39,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:54:39,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:54:39,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:54:39,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:54:39,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:54:39,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:54:39,215 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 -> 7d58750164873693a8e41f270259eb299f067753793be4bdf6f5449bb7376f85 [2025-01-09 03:54:39,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:54:39,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:54:39,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:54:39,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:54:39,472 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:54:39,473 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product33.cil.c [2025-01-09 03:54:40,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417f48f54/85d2053b349d4001806d121e9323f9b1/FLAG12c925298 [2025-01-09 03:54:41,036 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:54:41,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product33.cil.c [2025-01-09 03:54:41,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417f48f54/85d2053b349d4001806d121e9323f9b1/FLAG12c925298 [2025-01-09 03:54:41,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/417f48f54/85d2053b349d4001806d121e9323f9b1 [2025-01-09 03:54:41,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:54:41,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:54:41,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:54:41,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:54:41,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:54:41,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:41" (1/1) ... [2025-01-09 03:54:41,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788f70fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41, skipping insertion in model container [2025-01-09 03:54:41,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:41" (1/1) ... [2025-01-09 03:54:41,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:54:41,645 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_product33.cil.c[11229,11242] [2025-01-09 03:54:41,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:54:41,900 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:54:41,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-01-09 03:54:41,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [414] [2025-01-09 03:54:41,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [423] [2025-01-09 03:54:41,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [750] [2025-01-09 03:54:41,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [969] [2025-01-09 03:54:41,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1004] [2025-01-09 03:54:41,908 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1415] [2025-01-09 03:54:41,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2480] [2025-01-09 03:54:41,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2617] [2025-01-09 03:54:41,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2634] [2025-01-09 03:54:41,909 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2661] [2025-01-09 03:54:41,925 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_product33.cil.c[11229,11242] [2025-01-09 03:54:41,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:54:42,033 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:54:42,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42 WrapperNode [2025-01-09 03:54:42,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:54:42,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:42,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:54:42,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:54:42,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,126 INFO L138 Inliner]: procedures = 134, calls = 212, calls flagged for inlining = 65, calls inlined = 60, statements flattened = 1076 [2025-01-09 03:54:42,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:42,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:54:42,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:54:42,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:54:42,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,143 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,171 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-01-09 03:54:42,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:54:42,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:54:42,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:54:42,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:54:42,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (1/1) ... [2025-01-09 03:54:42,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:42,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:42,262 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-01-09 03:54:42,266 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-01-09 03:54:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:54:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:54:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:54:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:54:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:54:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:54:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:54:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:54:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:54:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:54:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:54:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:54:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:54:42,295 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:54:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:54:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:54:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:54:42,297 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:54:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:54:42,297 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:54:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:54:42,297 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:54:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:54:42,298 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:54:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:54:42,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:54:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:54:42,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:54:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:54:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:54:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:54:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:54:42,298 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:54:42,299 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:54:42,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:54:42,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:54:42,458 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:54:42,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:54:43,385 INFO L? ?]: Removed 501 outVars from TransFormulas that were not future-live. [2025-01-09 03:54:43,389 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:54:43,424 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:54:43,426 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:54:43,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:43 BoogieIcfgContainer [2025-01-09 03:54:43,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:54:43,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:54:43,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:54:43,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:54:43,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:54:41" (1/3) ... [2025-01-09 03:54:43,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbb715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:43, skipping insertion in model container [2025-01-09 03:54:43,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:42" (2/3) ... [2025-01-09 03:54:43,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbb715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:43, skipping insertion in model container [2025-01-09 03:54:43,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:43" (3/3) ... [2025-01-09 03:54:43,436 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product33.cil.c [2025-01-09 03:54:43,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:54:43,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product33.cil.c that has 25 procedures, 387 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:54:43,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:54:43,514 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;@98f77ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:54:43,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:54:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 387 states, 298 states have (on average 1.5) internal successors, (447), 302 states have internal predecessors, (447), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 03:54:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:54:43,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:43,535 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-01-09 03:54:43,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:43,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1396169391, now seen corresponding path program 1 times [2025-01-09 03:54:43,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:43,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755316270] [2025-01-09 03:54:43,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:43,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:43,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:54:43,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:54:43,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:43,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:44,167 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:44,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:44,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755316270] [2025-01-09 03:54:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755316270] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:44,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532200574] [2025-01-09 03:54:44,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:44,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:44,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:44,174 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-01-09 03:54:44,176 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-01-09 03:54:44,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:54:44,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:54:44,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:44,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:44,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:54:44,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:44,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532200574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:44,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:44,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218391812] [2025-01-09 03:54:44,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:44,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:44,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:44,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:44,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:44,548 INFO L87 Difference]: Start difference. First operand has 387 states, 298 states have (on average 1.5) internal successors, (447), 302 states have internal predecessors, (447), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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-01-09 03:54:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:44,604 INFO L93 Difference]: Finished difference Result 618 states and 898 transitions. [2025-01-09 03:54:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:44,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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-01-09 03:54:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:44,617 INFO L225 Difference]: With dead ends: 618 [2025-01-09 03:54:44,618 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 03:54:44,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 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-01-09 03:54:44,623 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:44,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 03:54:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2025-01-09 03:54:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 293 states have (on average 1.4948805460750854) internal successors, (438), 296 states have internal predecessors, (438), 63 states have call successors, (63), 24 states have call predecessors, (63), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 03:54:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 563 transitions. [2025-01-09 03:54:44,693 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 563 transitions. Word has length 107 [2025-01-09 03:54:44,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:44,694 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 563 transitions. [2025-01-09 03:54:44,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 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-01-09 03:54:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 563 transitions. [2025-01-09 03:54:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:54:44,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:44,701 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:44,709 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-01-09 03:54:44,902 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-01-09 03:54:44,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:44,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash -292340066, now seen corresponding path program 1 times [2025-01-09 03:54:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653353113] [2025-01-09 03:54:44,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:44,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:54:44,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:54:44,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:44,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:45,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:45,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653353113] [2025-01-09 03:54:45,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653353113] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:45,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318919180] [2025-01-09 03:54:45,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:45,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:45,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:45,149 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-01-09 03:54:45,168 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-01-09 03:54:45,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:54:45,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:54:45,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:45,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:45,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:45,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:45,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318919180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:45,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:45,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105475435] [2025-01-09 03:54:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:45,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:45,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:45,448 INFO L87 Difference]: Start difference. First operand 381 states and 563 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (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-01-09 03:54:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:45,505 INFO L93 Difference]: Finished difference Result 797 states and 1193 transitions. [2025-01-09 03:54:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:45,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (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 115 [2025-01-09 03:54:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:45,515 INFO L225 Difference]: With dead ends: 797 [2025-01-09 03:54:45,516 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 03:54:45,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 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-01-09 03:54:45,520 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 115 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1094 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-01-09 03:54:45,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1094 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 03:54:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 434. [2025-01-09 03:54:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 335 states have (on average 1.5134328358208955) internal successors, (507), 338 states have internal predecessors, (507), 74 states have call successors, (74), 24 states have call predecessors, (74), 24 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 03:54:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 654 transitions. [2025-01-09 03:54:45,570 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 654 transitions. Word has length 115 [2025-01-09 03:54:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:45,570 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 654 transitions. [2025-01-09 03:54:45,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (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-01-09 03:54:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 654 transitions. [2025-01-09 03:54:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:54:45,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:45,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:45,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:45,777 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-01-09 03:54:45,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:45,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash -415071289, now seen corresponding path program 1 times [2025-01-09 03:54:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:45,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392696245] [2025-01-09 03:54:45,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:45,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:54:45,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:54:45,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:45,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:46,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:46,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392696245] [2025-01-09 03:54:46,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392696245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:46,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567349078] [2025-01-09 03:54:46,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:46,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:46,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:46,023 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-01-09 03:54:46,029 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-01-09 03:54:46,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:54:46,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:54:46,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:46,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:46,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:54:46,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:46,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:46,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567349078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:46,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823102154] [2025-01-09 03:54:46,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:46,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:46,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:46,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:46,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:46,346 INFO L87 Difference]: Start difference. First operand 434 states and 654 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-01-09 03:54:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:46,436 INFO L93 Difference]: Finished difference Result 859 states and 1298 transitions. [2025-01-09 03:54:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:46,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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 116 [2025-01-09 03:54:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:46,441 INFO L225 Difference]: With dead ends: 859 [2025-01-09 03:54:46,441 INFO L226 Difference]: Without dead ends: 436 [2025-01-09 03:54:46,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 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-01-09 03:54:46,444 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2205 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-01-09 03:54:46,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2205 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-01-09 03:54:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-01-09 03:54:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 336 states have (on average 1.5119047619047619) internal successors, (508), 340 states have internal predecessors, (508), 74 states have call successors, (74), 24 states have call predecessors, (74), 25 states have return successors, (75), 73 states have call predecessors, (75), 73 states have call successors, (75) [2025-01-09 03:54:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 657 transitions. [2025-01-09 03:54:46,465 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 657 transitions. Word has length 116 [2025-01-09 03:54:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:46,465 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 657 transitions. [2025-01-09 03:54:46,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 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-01-09 03:54:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 657 transitions. [2025-01-09 03:54:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:54:46,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:46,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:46,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:46,669 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-01-09 03:54:46,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:46,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1847150936, now seen corresponding path program 1 times [2025-01-09 03:54:46,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:46,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238937637] [2025-01-09 03:54:46,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:46,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:46,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:54:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:54:46,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:46,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238937637] [2025-01-09 03:54:46,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238937637] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471172574] [2025-01-09 03:54:46,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:46,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:46,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:46,851 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-01-09 03:54:46,853 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-01-09 03:54:46,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:54:47,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:54:47,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:47,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:47,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:47,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:47,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:47,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471172574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:47,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:54:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036491535] [2025-01-09 03:54:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:47,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:47,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:47,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:47,129 INFO L87 Difference]: Start difference. First operand 436 states and 657 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-01-09 03:54:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:47,194 INFO L93 Difference]: Finished difference Result 861 states and 1303 transitions. [2025-01-09 03:54:47,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:47,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 117 [2025-01-09 03:54:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:47,200 INFO L225 Difference]: With dead ends: 861 [2025-01-09 03:54:47,201 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 03:54:47,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 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-01-09 03:54:47,203 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2191 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-01-09 03:54:47,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2191 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 03:54:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-01-09 03:54:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 337 states have (on average 1.510385756676558) internal successors, (509), 342 states have internal predecessors, (509), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (80), 73 states have call predecessors, (80), 73 states have call successors, (80) [2025-01-09 03:54:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 663 transitions. [2025-01-09 03:54:47,216 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 663 transitions. Word has length 117 [2025-01-09 03:54:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:47,216 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 663 transitions. [2025-01-09 03:54:47,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-01-09 03:54:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 663 transitions. [2025-01-09 03:54:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:54:47,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:47,218 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] [2025-01-09 03:54:47,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:47,418 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-01-09 03:54:47,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:47,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash -74206362, now seen corresponding path program 1 times [2025-01-09 03:54:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382984458] [2025-01-09 03:54:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:47,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:54:47,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:54:47,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:47,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382984458] [2025-01-09 03:54:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382984458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:47,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369740311] [2025-01-09 03:54:47,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:47,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:47,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:47,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:47,565 INFO L87 Difference]: Start difference. First operand 438 states and 663 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-01-09 03:54:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:47,605 INFO L93 Difference]: Finished difference Result 853 states and 1294 transitions. [2025-01-09 03:54:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:47,605 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-01-09 03:54:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:47,608 INFO L225 Difference]: With dead ends: 853 [2025-01-09 03:54:47,608 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 03:54:47,610 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-01-09 03:54:47,612 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2209 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-01-09 03:54:47,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2209 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:47,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 03:54:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-01-09 03:54:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 337 states have (on average 1.510385756676558) internal successors, (509), 342 states have internal predecessors, (509), 74 states have call successors, (74), 24 states have call predecessors, (74), 26 states have return successors, (79), 73 states have call predecessors, (79), 73 states have call successors, (79) [2025-01-09 03:54:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 662 transitions. [2025-01-09 03:54:47,638 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 662 transitions. Word has length 118 [2025-01-09 03:54:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:47,639 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 662 transitions. [2025-01-09 03:54:47,639 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-01-09 03:54:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 662 transitions. [2025-01-09 03:54:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:54:47,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:47,642 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] [2025-01-09 03:54:47,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:54:47,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:47,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1154839897, now seen corresponding path program 2 times [2025-01-09 03:54:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:47,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207655652] [2025-01-09 03:54:47,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:47,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-01-09 03:54:47,669 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 119 statements. [2025-01-09 03:54:47,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:47,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207655652] [2025-01-09 03:54:47,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207655652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:47,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:47,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784397169] [2025-01-09 03:54:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:47,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:47,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:47,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:47,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:47,794 INFO L87 Difference]: Start difference. First operand 438 states and 662 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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-01-09 03:54:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:48,126 INFO L93 Difference]: Finished difference Result 885 states and 1348 transitions. [2025-01-09 03:54:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:48,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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 119 [2025-01-09 03:54:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:48,131 INFO L225 Difference]: With dead ends: 885 [2025-01-09 03:54:48,131 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 03:54:48,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:54:48,132 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 932 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:48,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 3277 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:54:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 03:54:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 871. [2025-01-09 03:54:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 672 states have (on average 1.5148809523809523) internal successors, (1018), 679 states have internal predecessors, (1018), 146 states have call successors, (146), 49 states have call predecessors, (146), 52 states have return successors, (161), 146 states have call predecessors, (161), 144 states have call successors, (161) [2025-01-09 03:54:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1325 transitions. [2025-01-09 03:54:48,165 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1325 transitions. Word has length 119 [2025-01-09 03:54:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:48,166 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1325 transitions. [2025-01-09 03:54:48,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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-01-09 03:54:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1325 transitions. [2025-01-09 03:54:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:54:48,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:48,169 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] [2025-01-09 03:54:48,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:54:48,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:48,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1580551601, now seen corresponding path program 1 times [2025-01-09 03:54:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:48,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9709113] [2025-01-09 03:54:48,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:48,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:54:48,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:54:48,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:48,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:48,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9709113] [2025-01-09 03:54:48,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9709113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77921067] [2025-01-09 03:54:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:48,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:48,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:48,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:48,305 INFO L87 Difference]: Start difference. First operand 871 states and 1325 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-01-09 03:54:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:48,365 INFO L93 Difference]: Finished difference Result 1711 states and 2610 transitions. [2025-01-09 03:54:48,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:48,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 120 [2025-01-09 03:54:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:48,370 INFO L225 Difference]: With dead ends: 1711 [2025-01-09 03:54:48,371 INFO L226 Difference]: Without dead ends: 875 [2025-01-09 03:54:48,374 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-01-09 03:54:48,375 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2212 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-01-09 03:54:48,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2212 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-01-09 03:54:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2025-01-09 03:54:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 674 states have (on average 1.513353115727003) internal successors, (1020), 683 states have internal predecessors, (1020), 146 states have call successors, (146), 49 states have call predecessors, (146), 54 states have return successors, (164), 146 states have call predecessors, (164), 144 states have call successors, (164) [2025-01-09 03:54:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1330 transitions. [2025-01-09 03:54:48,421 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1330 transitions. Word has length 120 [2025-01-09 03:54:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:48,421 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1330 transitions. [2025-01-09 03:54:48,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-01-09 03:54:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1330 transitions. [2025-01-09 03:54:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:54:48,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:48,424 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] [2025-01-09 03:54:48,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:54:48,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:48,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash -173243799, now seen corresponding path program 1 times [2025-01-09 03:54:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:48,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597141015] [2025-01-09 03:54:48,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:48,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:54:48,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:54:48,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:48,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:48,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597141015] [2025-01-09 03:54:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597141015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:48,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:48,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:48,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330748270] [2025-01-09 03:54:48,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:48,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:48,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:48,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:48,559 INFO L87 Difference]: Start difference. First operand 875 states and 1330 transitions. Second operand has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 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-01-09 03:54:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:48,684 INFO L93 Difference]: Finished difference Result 1710 states and 2603 transitions. [2025-01-09 03:54:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:48,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 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-01-09 03:54:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:48,691 INFO L225 Difference]: With dead ends: 1710 [2025-01-09 03:54:48,691 INFO L226 Difference]: Without dead ends: 879 [2025-01-09 03:54:48,694 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-01-09 03:54:48,694 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 7 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3793 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-01-09 03:54:48,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3793 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-01-09 03:54:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2025-01-09 03:54:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 676 states have (on average 1.5118343195266273) internal successors, (1022), 684 states have internal predecessors, (1022), 146 states have call successors, (146), 50 states have call predecessors, (146), 54 states have return successors, (162), 146 states have call predecessors, (162), 144 states have call successors, (162) [2025-01-09 03:54:48,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1330 transitions. [2025-01-09 03:54:48,733 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1330 transitions. Word has length 121 [2025-01-09 03:54:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:48,734 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1330 transitions. [2025-01-09 03:54:48,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 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-01-09 03:54:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1330 transitions. [2025-01-09 03:54:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:54:48,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:48,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:48,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:54:48,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:48,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash -952517175, now seen corresponding path program 2 times [2025-01-09 03:54:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:48,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696349401] [2025-01-09 03:54:48,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:48,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:48,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-01-09 03:54:48,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 122 statements. [2025-01-09 03:54:48,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:48,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:48,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696349401] [2025-01-09 03:54:48,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696349401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:48,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:48,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392078795] [2025-01-09 03:54:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:48,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:48,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:48,874 INFO L87 Difference]: Start difference. First operand 877 states and 1330 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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-01-09 03:54:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:49,239 INFO L93 Difference]: Finished difference Result 1779 states and 2723 transitions. [2025-01-09 03:54:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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 122 [2025-01-09 03:54:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:49,248 INFO L225 Difference]: With dead ends: 1779 [2025-01-09 03:54:49,248 INFO L226 Difference]: Without dead ends: 1773 [2025-01-09 03:54:49,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:54:49,249 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 924 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:49,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 3306 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:54:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-01-09 03:54:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1751. [2025-01-09 03:54:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1350 states have (on average 1.5133333333333334) internal successors, (2043), 1368 states have internal predecessors, (2043), 288 states have call successors, (288), 100 states have call predecessors, (288), 112 states have return successors, (347), 290 states have call predecessors, (347), 284 states have call successors, (347) [2025-01-09 03:54:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2678 transitions. [2025-01-09 03:54:49,323 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2678 transitions. Word has length 122 [2025-01-09 03:54:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:49,324 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2678 transitions. [2025-01-09 03:54:49,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 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-01-09 03:54:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2678 transitions. [2025-01-09 03:54:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:54:49,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:49,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:49,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:54:49,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:49,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -380732627, now seen corresponding path program 1 times [2025-01-09 03:54:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:49,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393949146] [2025-01-09 03:54:49,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:49,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:54:49,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:54:49,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:49,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 03:54:49,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393949146] [2025-01-09 03:54:49,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393949146] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881897390] [2025-01-09 03:54:49,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:49,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:49,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:49,455 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-01-09 03:54:49,456 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-01-09 03:54:49,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:54:49,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:54:49,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:49,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:49,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:49,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:54:49,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881897390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:49,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:49,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:49,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469199764] [2025-01-09 03:54:49,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:49,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:49,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:49,751 INFO L87 Difference]: Start difference. First operand 1751 states and 2678 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-01-09 03:54:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:49,846 INFO L93 Difference]: Finished difference Result 2639 states and 4028 transitions. [2025-01-09 03:54:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:49,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 122 [2025-01-09 03:54:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:49,856 INFO L225 Difference]: With dead ends: 2639 [2025-01-09 03:54:49,856 INFO L226 Difference]: Without dead ends: 1755 [2025-01-09 03:54:49,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 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-01-09 03:54:49,859 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2202 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-01-09 03:54:49,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2202 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2025-01-09 03:54:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1747. [2025-01-09 03:54:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1348 states have (on average 1.513353115727003) internal successors, (2040), 1366 states have internal predecessors, (2040), 286 states have call successors, (286), 100 states have call predecessors, (286), 112 states have return successors, (345), 288 states have call predecessors, (345), 282 states have call successors, (345) [2025-01-09 03:54:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2671 transitions. [2025-01-09 03:54:49,929 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2671 transitions. Word has length 122 [2025-01-09 03:54:49,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:49,929 INFO L471 AbstractCegarLoop]: Abstraction has 1747 states and 2671 transitions. [2025-01-09 03:54:49,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-01-09 03:54:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2671 transitions. [2025-01-09 03:54:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:54:49,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:49,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:49,941 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-01-09 03:54:50,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:54:50,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:50,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash 791508413, now seen corresponding path program 1 times [2025-01-09 03:54:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:50,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99228676] [2025-01-09 03:54:50,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:50,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:50,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:54:50,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:54:50,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:50,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:50,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:50,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99228676] [2025-01-09 03:54:50,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99228676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:50,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:50,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538744927] [2025-01-09 03:54:50,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:50,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:50,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:50,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:50,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:50,286 INFO L87 Difference]: Start difference. First operand 1747 states and 2671 transitions. Second operand has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 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-01-09 03:54:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:50,492 INFO L93 Difference]: Finished difference Result 3435 states and 5258 transitions. [2025-01-09 03:54:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 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 123 [2025-01-09 03:54:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:50,505 INFO L225 Difference]: With dead ends: 3435 [2025-01-09 03:54:50,505 INFO L226 Difference]: Without dead ends: 1755 [2025-01-09 03:54:50,511 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-01-09 03:54:50,512 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 5 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3807 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-01-09 03:54:50,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3807 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:50,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2025-01-09 03:54:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1751. [2025-01-09 03:54:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1352 states have (on average 1.5118343195266273) internal successors, (2044), 1369 states have internal predecessors, (2044), 286 states have call successors, (286), 101 states have call predecessors, (286), 112 states have return successors, (341), 288 states have call predecessors, (341), 282 states have call successors, (341) [2025-01-09 03:54:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2671 transitions. [2025-01-09 03:54:50,589 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2671 transitions. Word has length 123 [2025-01-09 03:54:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:50,589 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2671 transitions. [2025-01-09 03:54:50,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 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-01-09 03:54:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2671 transitions. [2025-01-09 03:54:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:54:50,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:50,595 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] [2025-01-09 03:54:50,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:54:50,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:50,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash 672814712, now seen corresponding path program 1 times [2025-01-09 03:54:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:50,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741752046] [2025-01-09 03:54:50,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:50,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:54:50,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:54:50,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:50,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:50,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:50,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741752046] [2025-01-09 03:54:50,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741752046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:50,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790182899] [2025-01-09 03:54:50,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:50,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:50,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:50,737 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-01-09 03:54:50,738 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-01-09 03:54:50,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:54:50,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:54:50,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:50,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:50,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:50,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:51,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:54:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790182899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:54:51,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:54:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:54:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553408964] [2025-01-09 03:54:51,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:54:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:54:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:51,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:54:51,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:51,095 INFO L87 Difference]: Start difference. First operand 1751 states and 2671 transitions. Second operand has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-01-09 03:54:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:51,743 INFO L93 Difference]: Finished difference Result 4909 states and 7854 transitions. [2025-01-09 03:54:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:54:51,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 124 [2025-01-09 03:54:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:51,761 INFO L225 Difference]: With dead ends: 4909 [2025-01-09 03:54:51,762 INFO L226 Difference]: Without dead ends: 3237 [2025-01-09 03:54:51,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:54:51,771 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 1229 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 3949 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:51,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 3949 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:54:51,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2025-01-09 03:54:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 3141. [2025-01-09 03:54:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 2486 states have (on average 1.5711987127916331) internal successors, (3906), 2502 states have internal predecessors, (3906), 542 states have call successors, (542), 102 states have call predecessors, (542), 112 states have return successors, (677), 544 states have call predecessors, (677), 538 states have call successors, (677) [2025-01-09 03:54:51,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5125 transitions. [2025-01-09 03:54:51,910 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5125 transitions. Word has length 124 [2025-01-09 03:54:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:51,911 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5125 transitions. [2025-01-09 03:54:51,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-01-09 03:54:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5125 transitions. [2025-01-09 03:54:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:54:51,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:51,922 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-01-09 03:54:51,930 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-01-09 03:54:52,123 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,SelfDestructingSolverStorable11 [2025-01-09 03:54:52,123 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:52,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash 191610385, now seen corresponding path program 1 times [2025-01-09 03:54:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177890724] [2025-01-09 03:54:52,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:52,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:52,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:54:52,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:54:52,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:52,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177890724] [2025-01-09 03:54:52,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177890724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:52,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:52,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757554359] [2025-01-09 03:54:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:52,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:52,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:52,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:52,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:52,232 INFO L87 Difference]: Start difference. First operand 3141 states and 5125 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-01-09 03:54:52,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:52,369 INFO L93 Difference]: Finished difference Result 7319 states and 12164 transitions. [2025-01-09 03:54:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:52,371 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-01-09 03:54:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:52,399 INFO L225 Difference]: With dead ends: 7319 [2025-01-09 03:54:52,399 INFO L226 Difference]: Without dead ends: 4445 [2025-01-09 03:54:52,411 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-01-09 03:54:52,413 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 112 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1122 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-01-09 03:54:52,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2025-01-09 03:54:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4413. [2025-01-09 03:54:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4413 states, 3502 states have (on average 1.5928041119360365) internal successors, (5578), 3518 states have internal predecessors, (5578), 798 states have call successors, (798), 102 states have call predecessors, (798), 112 states have return successors, (1013), 800 states have call predecessors, (1013), 794 states have call successors, (1013) [2025-01-09 03:54:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 7389 transitions. [2025-01-09 03:54:52,667 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 7389 transitions. Word has length 128 [2025-01-09 03:54:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:52,667 INFO L471 AbstractCegarLoop]: Abstraction has 4413 states and 7389 transitions. [2025-01-09 03:54:52,668 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-01-09 03:54:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 7389 transitions. [2025-01-09 03:54:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:54:52,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:52,689 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-01-09 03:54:52,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:54:52,689 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:52,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1141269183, now seen corresponding path program 1 times [2025-01-09 03:54:52,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:52,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103248443] [2025-01-09 03:54:52,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:52,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:54:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:54:52,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:52,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103248443] [2025-01-09 03:54:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103248443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:52,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:52,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814758987] [2025-01-09 03:54:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:52,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:52,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:52,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:52,762 INFO L87 Difference]: Start difference. First operand 4413 states and 7389 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-01-09 03:54:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:52,935 INFO L93 Difference]: Finished difference Result 10471 states and 17672 transitions. [2025-01-09 03:54:52,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:52,936 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-01-09 03:54:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:52,977 INFO L225 Difference]: With dead ends: 10471 [2025-01-09 03:54:52,977 INFO L226 Difference]: Without dead ends: 6529 [2025-01-09 03:54:52,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:52,995 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 110 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1116 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-01-09 03:54:52,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6529 states. [2025-01-09 03:54:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6529 to 6497. [2025-01-09 03:54:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6497 states, 5206 states have (on average 1.6046868997310795) internal successors, (8354), 5222 states have internal predecessors, (8354), 1178 states have call successors, (1178), 102 states have call predecessors, (1178), 112 states have return successors, (1457), 1180 states have call predecessors, (1457), 1174 states have call successors, (1457) [2025-01-09 03:54:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6497 states to 6497 states and 10989 transitions. [2025-01-09 03:54:53,262 INFO L78 Accepts]: Start accepts. Automaton has 6497 states and 10989 transitions. Word has length 129 [2025-01-09 03:54:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:53,262 INFO L471 AbstractCegarLoop]: Abstraction has 6497 states and 10989 transitions. [2025-01-09 03:54:53,262 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-01-09 03:54:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6497 states and 10989 transitions. [2025-01-09 03:54:53,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:54:53,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:53,290 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-01-09 03:54:53,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:54:53,291 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:53,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1914755679, now seen corresponding path program 1 times [2025-01-09 03:54:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:53,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881632694] [2025-01-09 03:54:53,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:53,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:54:53,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:54:53,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:53,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881632694] [2025-01-09 03:54:53,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881632694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278771127] [2025-01-09 03:54:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:53,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:53,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:53,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:53,340 INFO L87 Difference]: Start difference. First operand 6497 states and 10989 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-01-09 03:54:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:53,546 INFO L93 Difference]: Finished difference Result 15187 states and 25936 transitions. [2025-01-09 03:54:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:53,546 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-01-09 03:54:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:53,590 INFO L225 Difference]: With dead ends: 15187 [2025-01-09 03:54:53,591 INFO L226 Difference]: Without dead ends: 9685 [2025-01-09 03:54:53,614 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-01-09 03:54:53,615 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 108 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1111 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-01-09 03:54:53,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9685 states. [2025-01-09 03:54:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9685 to 9653. [2025-01-09 03:54:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9653 states, 7870 states have (on average 1.6139771283354511) internal successors, (12702), 7886 states have internal predecessors, (12702), 1670 states have call successors, (1670), 102 states have call predecessors, (1670), 112 states have return successors, (2117), 1672 states have call predecessors, (2117), 1666 states have call successors, (2117) [2025-01-09 03:54:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 16489 transitions. [2025-01-09 03:54:54,006 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 16489 transitions. Word has length 130 [2025-01-09 03:54:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:54,007 INFO L471 AbstractCegarLoop]: Abstraction has 9653 states and 16489 transitions. [2025-01-09 03:54:54,007 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-01-09 03:54:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 16489 transitions. [2025-01-09 03:54:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:54:54,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:54,042 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-01-09 03:54:54,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:54:54,042 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:54,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash 491794978, now seen corresponding path program 1 times [2025-01-09 03:54:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459732891] [2025-01-09 03:54:54,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:54,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:54:54,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:54:54,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:54,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:54,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:54,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459732891] [2025-01-09 03:54:54,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459732891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:54,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067815739] [2025-01-09 03:54:54,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:54,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:54,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:54,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:54,089 INFO L87 Difference]: Start difference. First operand 9653 states and 16489 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-01-09 03:54:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:54,523 INFO L93 Difference]: Finished difference Result 22539 states and 38844 transitions. [2025-01-09 03:54:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:54,523 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-01-09 03:54:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:54,589 INFO L225 Difference]: With dead ends: 22539 [2025-01-09 03:54:54,590 INFO L226 Difference]: Without dead ends: 14729 [2025-01-09 03:54:54,625 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-01-09 03:54:54,626 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 106 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1111 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-01-09 03:54:54,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14729 states. [2025-01-09 03:54:55,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14729 to 14697. [2025-01-09 03:54:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14697 states, 12198 states have (on average 1.6201016560091819) internal successors, (19762), 12214 states have internal predecessors, (19762), 2386 states have call successors, (2386), 102 states have call predecessors, (2386), 112 states have return successors, (3113), 2388 states have call predecessors, (3113), 2382 states have call successors, (3113) [2025-01-09 03:54:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14697 states to 14697 states and 25261 transitions. [2025-01-09 03:54:55,285 INFO L78 Accepts]: Start accepts. Automaton has 14697 states and 25261 transitions. Word has length 131 [2025-01-09 03:54:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:55,285 INFO L471 AbstractCegarLoop]: Abstraction has 14697 states and 25261 transitions. [2025-01-09 03:54:55,285 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-01-09 03:54:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 14697 states and 25261 transitions. [2025-01-09 03:54:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:54:55,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:55,324 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-01-09 03:54:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:54:55,324 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:55,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:55,324 INFO L85 PathProgramCache]: Analyzing trace with hash 883729627, now seen corresponding path program 1 times [2025-01-09 03:54:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656307089] [2025-01-09 03:54:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:55,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:54:55,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:54:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656307089] [2025-01-09 03:54:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656307089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:55,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:55,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:55,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011936886] [2025-01-09 03:54:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:55,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:55,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:55,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:55,375 INFO L87 Difference]: Start difference. First operand 14697 states and 25261 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-01-09 03:54:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:55,792 INFO L93 Difference]: Finished difference Result 34643 states and 60080 transitions. [2025-01-09 03:54:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:55,793 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-01-09 03:54:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:55,886 INFO L225 Difference]: With dead ends: 34643 [2025-01-09 03:54:55,886 INFO L226 Difference]: Without dead ends: 23073 [2025-01-09 03:54:55,919 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-01-09 03:54:55,919 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 104 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1131 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-01-09 03:54:55,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23073 states. [2025-01-09 03:54:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23073 to 23041. [2025-01-09 03:54:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23041 states, 19038 states have (on average 1.6160310957033301) internal successors, (30766), 19054 states have internal predecessors, (30766), 3890 states have call successors, (3890), 102 states have call predecessors, (3890), 112 states have return successors, (5105), 3892 states have call predecessors, (5105), 3886 states have call successors, (5105) [2025-01-09 03:54:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23041 states to 23041 states and 39761 transitions. [2025-01-09 03:54:56,713 INFO L78 Accepts]: Start accepts. Automaton has 23041 states and 39761 transitions. Word has length 132 [2025-01-09 03:54:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:56,714 INFO L471 AbstractCegarLoop]: Abstraction has 23041 states and 39761 transitions. [2025-01-09 03:54:56,714 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-01-09 03:54:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23041 states and 39761 transitions. [2025-01-09 03:54:56,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 03:54:56,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:56,768 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-01-09 03:54:56,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:54:56,768 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash -770899034, now seen corresponding path program 1 times [2025-01-09 03:54:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:56,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344075124] [2025-01-09 03:54:56,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:56,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 03:54:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 03:54:56,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:56,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:56,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344075124] [2025-01-09 03:54:56,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344075124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:56,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:56,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909295097] [2025-01-09 03:54:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:56,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:56,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:56,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:56,821 INFO L87 Difference]: Start difference. First operand 23041 states and 39761 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-01-09 03:54:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:57,939 INFO L93 Difference]: Finished difference Result 56579 states and 98068 transitions. [2025-01-09 03:54:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:57,940 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-01-09 03:54:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:58,129 INFO L225 Difference]: With dead ends: 56579 [2025-01-09 03:54:58,130 INFO L226 Difference]: Without dead ends: 38209 [2025-01-09 03:54:58,206 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-01-09 03:54:58,207 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 102 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1116 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-01-09 03:54:58,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:58,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38209 states. [2025-01-09 03:54:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38209 to 38177. [2025-01-09 03:54:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38177 states, 31750 states have (on average 1.6146771653543308) internal successors, (51266), 31766 states have internal predecessors, (51266), 6314 states have call successors, (6314), 102 states have call predecessors, (6314), 112 states have return successors, (8129), 6316 states have call predecessors, (8129), 6310 states have call successors, (8129) [2025-01-09 03:54:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38177 states to 38177 states and 65709 transitions. [2025-01-09 03:54:59,675 INFO L78 Accepts]: Start accepts. Automaton has 38177 states and 65709 transitions. Word has length 133 [2025-01-09 03:54:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:59,676 INFO L471 AbstractCegarLoop]: Abstraction has 38177 states and 65709 transitions. [2025-01-09 03:54:59,676 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-01-09 03:54:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 38177 states and 65709 transitions. [2025-01-09 03:54:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 03:54:59,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:59,748 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-01-09 03:54:59,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:54:59,748 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:59,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1401615479, now seen corresponding path program 1 times [2025-01-09 03:54:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:59,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759536289] [2025-01-09 03:54:59,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:59,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 03:54:59,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 03:54:59,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:59,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759536289] [2025-01-09 03:54:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759536289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:59,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:59,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:59,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253594082] [2025-01-09 03:54:59,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:59,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:59,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:59,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:59,795 INFO L87 Difference]: Start difference. First operand 38177 states and 65709 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-01-09 03:55:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:01,109 INFO L93 Difference]: Finished difference Result 98463 states and 170240 transitions. [2025-01-09 03:55:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:01,110 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-01-09 03:55:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:01,410 INFO L225 Difference]: With dead ends: 98463 [2025-01-09 03:55:01,411 INFO L226 Difference]: Without dead ends: 66797 [2025-01-09 03:55:01,507 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-01-09 03:55:01,507 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 100 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1134 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-01-09 03:55:01,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66797 states. [2025-01-09 03:55:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66797 to 66765. [2025-01-09 03:55:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66765 states, 55526 states have (on average 1.6062024997298563) internal successors, (89186), 55542 states have internal predecessors, (89186), 11126 states have call successors, (11126), 102 states have call predecessors, (11126), 112 states have return successors, (14353), 11128 states have call predecessors, (14353), 11122 states have call successors, (14353) [2025-01-09 03:55:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66765 states to 66765 states and 114665 transitions. [2025-01-09 03:55:04,163 INFO L78 Accepts]: Start accepts. Automaton has 66765 states and 114665 transitions. Word has length 134 [2025-01-09 03:55:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:04,164 INFO L471 AbstractCegarLoop]: Abstraction has 66765 states and 114665 transitions. [2025-01-09 03:55:04,164 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-01-09 03:55:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 66765 states and 114665 transitions. [2025-01-09 03:55:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 03:55:04,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:04,262 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-01-09 03:55:04,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:55:04,262 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:04,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1675843161, now seen corresponding path program 1 times [2025-01-09 03:55:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:04,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752764606] [2025-01-09 03:55:04,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:04,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:04,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:55:04,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:55:04,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:04,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:04,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752764606] [2025-01-09 03:55:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752764606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:04,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:04,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778545352] [2025-01-09 03:55:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:04,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:04,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:04,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:04,312 INFO L87 Difference]: Start difference. First operand 66765 states and 114665 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-01-09 03:55:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:07,476 INFO L93 Difference]: Finished difference Result 176607 states and 304792 transitions. [2025-01-09 03:55:07,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:07,476 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-01-09 03:55:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:07,959 INFO L225 Difference]: With dead ends: 176607 [2025-01-09 03:55:07,959 INFO L226 Difference]: Without dead ends: 118945 [2025-01-09 03:55:08,120 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-01-09 03:55:08,122 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 98 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1114 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-01-09 03:55:08,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118945 states. [2025-01-09 03:55:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118945 to 118913. [2025-01-09 03:55:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118913 states, 99518 states have (on average 1.6019815510761872) internal successors, (159426), 99534 states have internal predecessors, (159426), 19282 states have call successors, (19282), 102 states have call predecessors, (19282), 112 states have return successors, (25217), 19284 states have call predecessors, (25217), 19278 states have call successors, (25217) [2025-01-09 03:55:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118913 states to 118913 states and 203925 transitions. [2025-01-09 03:55:13,573 INFO L78 Accepts]: Start accepts. Automaton has 118913 states and 203925 transitions. Word has length 135 [2025-01-09 03:55:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:13,573 INFO L471 AbstractCegarLoop]: Abstraction has 118913 states and 203925 transitions. [2025-01-09 03:55:13,573 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-01-09 03:55:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 118913 states and 203925 transitions. [2025-01-09 03:55:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:55:13,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:13,751 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-01-09 03:55:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:55:13,751 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash 744278955, now seen corresponding path program 1 times [2025-01-09 03:55:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835335735] [2025-01-09 03:55:13,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:13,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:55:13,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:55:13,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:13,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:13,806 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:13,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835335735] [2025-01-09 03:55:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835335735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:13,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:13,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:13,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8889016] [2025-01-09 03:55:13,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:13,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:13,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:13,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:13,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:13,808 INFO L87 Difference]: Start difference. First operand 118913 states and 203925 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-01-09 03:55:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:19,028 INFO L93 Difference]: Finished difference Result 324215 states and 555880 transitions. [2025-01-09 03:55:19,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:19,028 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-01-09 03:55:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:20,254 INFO L225 Difference]: With dead ends: 324215 [2025-01-09 03:55:20,255 INFO L226 Difference]: Without dead ends: 217505 [2025-01-09 03:55:20,542 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-01-09 03:55:20,545 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 96 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1116 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-01-09 03:55:20,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:20,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217505 states.