./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product31.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_spec1_product31.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca4739abfecd00b8d2b799ccc2617c6e4b4e221f88b8a7e722070835771a8404 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:51:17,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:51:17,770 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:51:17,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:51:17,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:51:17,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:51:17,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:51:17,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:51:17,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:51:17,803 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:51:17,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:51:17,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:51:17,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:51:17,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:51:17,805 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:51:17,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:51:17,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:51:17,805 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:51:17,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:51:17,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:51:17,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:51:17,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:51:17,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:51:17,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:51:17,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:51:17,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:51:17,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:51:17,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:51:17,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:51:17,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:51:17,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:51:17,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:51:17,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:51:17,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:51:17,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:51:17,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:51:17,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:51:17,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:51:17,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:51:17,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:51:17,810 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 -> ca4739abfecd00b8d2b799ccc2617c6e4b4e221f88b8a7e722070835771a8404 [2025-01-09 03:51:18,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:51:18,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:51:18,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:51:18,138 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:51:18,138 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:51:18,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product31.cil.c [2025-01-09 03:51:19,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26cab751b/63e476562a9a463c92693c1462484298/FLAG05be974da [2025-01-09 03:51:19,835 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:51:19,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c [2025-01-09 03:51:19,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26cab751b/63e476562a9a463c92693c1462484298/FLAG05be974da [2025-01-09 03:51:19,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26cab751b/63e476562a9a463c92693c1462484298 [2025-01-09 03:51:19,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:51:19,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:51:19,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:51:19,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:51:19,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:51:19,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:19" (1/1) ... [2025-01-09 03:51:19,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7382e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:19, skipping insertion in model container [2025-01-09 03:51:19,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:51:19" (1/1) ... [2025-01-09 03:51:19,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:51:20,592 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_spec1_product31.cil.c[64142,64155] [2025-01-09 03:51:20,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:51:20,631 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:51:20,641 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-01-09 03:51:20,643 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [66] [2025-01-09 03:51:20,643 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [108] [2025-01-09 03:51:20,643 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [489] [2025-01-09 03:51:20,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [855] [2025-01-09 03:51:20,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [992] [2025-01-09 03:51:20,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1217] [2025-01-09 03:51:20,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1255] [2025-01-09 03:51:20,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1537] [2025-01-09 03:51:20,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1934] [2025-01-09 03:51:20,647 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3001] [2025-01-09 03:51:20,777 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_spec1_product31.cil.c[64142,64155] [2025-01-09 03:51:20,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:51:20,815 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:51:20,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20 WrapperNode [2025-01-09 03:51:20,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:51:20,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:51:20,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:51:20,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:51:20,822 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:51:20" (1/1) ... [2025-01-09 03:51:20,841 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:51:20" (1/1) ... [2025-01-09 03:51:20,892 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1026 [2025-01-09 03:51:20,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:51:20,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:51:20,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:51:20,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:51:20,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:20,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:20,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:20,963 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:51:20,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:20,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:20,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:20,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:21,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:21,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:21,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:21,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:51:21,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:51:21,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:51:21,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:51:21,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (1/1) ... [2025-01-09 03:51:21,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:51:21,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:21,072 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:51:21,077 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:51:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:51:21,099 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:51:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:51:21,099 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:51:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:51:21,099 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:51:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:51:21,099 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:51:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:51:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:51:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:51:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:51:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:51:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:51:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:51:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:51:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:51:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:51:21,102 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:51:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:51:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:51:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:51:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:51:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:51:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:51:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:51:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:51:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:51:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:51:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:51:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:51:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:51:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:51:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:51:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:51:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:51:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:51:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:51:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:51:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:51:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:51:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:51:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:51:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:51:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:51:21,309 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:51:21,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:51:22,398 INFO L? ?]: Removed 476 outVars from TransFormulas that were not future-live. [2025-01-09 03:51:22,398 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:51:22,429 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:51:22,433 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:51:22,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:22 BoogieIcfgContainer [2025-01-09 03:51:22,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:51:22,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:51:22,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:51:22,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:51:22,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:51:19" (1/3) ... [2025-01-09 03:51:22,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4392940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:22, skipping insertion in model container [2025-01-09 03:51:22,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:51:20" (2/3) ... [2025-01-09 03:51:22,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4392940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:51:22, skipping insertion in model container [2025-01-09 03:51:22,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:51:22" (3/3) ... [2025-01-09 03:51:22,451 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product31.cil.c [2025-01-09 03:51:22,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:51:22,471 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product31.cil.c that has 24 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:51:22,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:51:22,569 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;@32413e89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:51:22,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:51:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 284 states have (on average 1.5) internal successors, (426), 288 states have internal predecessors, (426), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 03:51:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:51:22,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:22,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:22,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:22,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash -483622185, now seen corresponding path program 1 times [2025-01-09 03:51:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:22,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672029804] [2025-01-09 03:51:22,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:22,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:51:22,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:51:22,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:22,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:51:23,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:23,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672029804] [2025-01-09 03:51:23,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672029804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:23,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320191864] [2025-01-09 03:51:23,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:23,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:23,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:23,343 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:51:23,345 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:51:23,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:51:23,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:51:23,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:23,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:23,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:51:23,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:51:23,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:51:23,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320191864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:23,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:51:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:51:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112704244] [2025-01-09 03:51:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:23,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:23,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:23,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:23,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:51:23,813 INFO L87 Difference]: Start difference. First operand has 368 states, 284 states have (on average 1.5) internal successors, (426), 288 states have internal predecessors, (426), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:23,921 INFO L93 Difference]: Finished difference Result 585 states and 848 transitions. [2025-01-09 03:51:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-01-09 03:51:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:23,941 INFO L225 Difference]: With dead ends: 585 [2025-01-09 03:51:23,943 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 03:51:23,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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:51:23,955 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 1 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1075 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:51:23,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1075 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 03:51:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 362. [2025-01-09 03:51:24,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 279 states have (on average 1.4946236559139785) internal successors, (417), 282 states have internal predecessors, (417), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 03:51:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 534 transitions. [2025-01-09 03:51:24,048 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 534 transitions. Word has length 101 [2025-01-09 03:51:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:24,050 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 534 transitions. [2025-01-09 03:51:24,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 534 transitions. [2025-01-09 03:51:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:51:24,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:24,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:24,064 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:51:24,257 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:51:24,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:24,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:24,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1688894756, now seen corresponding path program 1 times [2025-01-09 03:51:24,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:24,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128246569] [2025-01-09 03:51:24,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:24,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:51:24,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:51:24,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:24,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:51:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128246569] [2025-01-09 03:51:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128246569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858908161] [2025-01-09 03:51:24,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:24,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:24,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:24,644 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:51:24,647 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:51:24,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:51:25,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:51:25,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:25,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:25,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:51:25,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:51:25,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:51:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858908161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:25,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:51:25,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:51:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928154769] [2025-01-09 03:51:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:25,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:25,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:25,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:51:25,063 INFO L87 Difference]: Start difference. First operand 362 states and 534 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:25,122 INFO L93 Difference]: Finished difference Result 754 states and 1127 transitions. [2025-01-09 03:51:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:25,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 106 [2025-01-09 03:51:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:25,133 INFO L225 Difference]: With dead ends: 754 [2025-01-09 03:51:25,133 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 03:51:25,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 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:51:25,135 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 107 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1036 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:51:25,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1036 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 03:51:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 410. [2025-01-09 03:51:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 316 states have (on average 1.5126582278481013) internal successors, (478), 319 states have internal predecessors, (478), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-01-09 03:51:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2025-01-09 03:51:25,177 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 106 [2025-01-09 03:51:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:25,177 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2025-01-09 03:51:25,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2025-01-09 03:51:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:51:25,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:25,180 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:25,191 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:51:25,384 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:51:25,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:25,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1330782680, now seen corresponding path program 1 times [2025-01-09 03:51:25,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:25,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121533048] [2025-01-09 03:51:25,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:25,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:25,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:51:25,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:51:25,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:25,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:51:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:25,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121533048] [2025-01-09 03:51:25,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121533048] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:25,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594879934] [2025-01-09 03:51:25,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:25,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:25,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:25,684 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:51:25,687 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:51:25,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:51:25,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:51:25,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:25,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:25,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:51:25,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:51:26,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:51:26,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594879934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:26,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:51:26,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:51:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405870878] [2025-01-09 03:51:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:26,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:26,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:26,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:51:26,054 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:26,137 INFO L93 Difference]: Finished difference Result 811 states and 1224 transitions. [2025-01-09 03:51:26,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:26,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2025-01-09 03:51:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:26,143 INFO L225 Difference]: With dead ends: 811 [2025-01-09 03:51:26,145 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 03:51:26,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 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:51:26,149 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:26,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2089 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:26,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 03:51:26,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-01-09 03:51:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 317 states have (on average 1.5110410094637223) internal successors, (479), 321 states have internal predecessors, (479), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2025-01-09 03:51:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 620 transitions. [2025-01-09 03:51:26,173 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 620 transitions. Word has length 107 [2025-01-09 03:51:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:26,173 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 620 transitions. [2025-01-09 03:51:26,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 620 transitions. [2025-01-09 03:51:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:51:26,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:26,176 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:26,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:51:26,377 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:51:26,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:26,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:26,378 INFO L85 PathProgramCache]: Analyzing trace with hash 636075744, now seen corresponding path program 1 times [2025-01-09 03:51:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:26,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814157226] [2025-01-09 03:51:26,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:26,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:51:26,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:51:26,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:26,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:26,643 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:51:26,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814157226] [2025-01-09 03:51:26,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814157226] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438296812] [2025-01-09 03:51:26,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:26,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:26,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:26,648 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:51:26,652 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:51:26,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:51:26,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:51:26,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:26,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:26,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:51:26,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:51:27,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:51:27,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438296812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:27,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:51:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:51:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493280958] [2025-01-09 03:51:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:27,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:27,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:27,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:27,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:51:27,025 INFO L87 Difference]: Start difference. First operand 412 states and 620 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:27,118 INFO L93 Difference]: Finished difference Result 813 states and 1229 transitions. [2025-01-09 03:51:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2025-01-09 03:51:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:27,127 INFO L225 Difference]: With dead ends: 813 [2025-01-09 03:51:27,127 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 03:51:27,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:51:27,130 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 2 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:27,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2075 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 03:51:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-01-09 03:51:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.509433962264151) internal successors, (480), 323 states have internal predecessors, (480), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2025-01-09 03:51:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 626 transitions. [2025-01-09 03:51:27,180 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 626 transitions. Word has length 108 [2025-01-09 03:51:27,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:27,182 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 626 transitions. [2025-01-09 03:51:27,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 626 transitions. [2025-01-09 03:51:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:51:27,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:27,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:27,197 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:51:27,391 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:51:27,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:27,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 598389355, now seen corresponding path program 1 times [2025-01-09 03:51:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:27,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218120230] [2025-01-09 03:51:27,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:27,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:51:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:51:27,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:27,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:51:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218120230] [2025-01-09 03:51:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218120230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:51:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536189946] [2025-01-09 03:51:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:27,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:27,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:27,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:51:27,583 INFO L87 Difference]: Start difference. First operand 414 states and 626 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:27,638 INFO L93 Difference]: Finished difference Result 805 states and 1220 transitions. [2025-01-09 03:51:27,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:27,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2025-01-09 03:51:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:27,642 INFO L225 Difference]: With dead ends: 805 [2025-01-09 03:51:27,642 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 03:51:27,644 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:51:27,644 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:27,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2093 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 03:51:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-01-09 03:51:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.509433962264151) internal successors, (480), 323 states have internal predecessors, (480), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2025-01-09 03:51:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 625 transitions. [2025-01-09 03:51:27,664 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 625 transitions. Word has length 109 [2025-01-09 03:51:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:27,664 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 625 transitions. [2025-01-09 03:51:27,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 625 transitions. [2025-01-09 03:51:27,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:51:27,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:27,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:27,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:51:27,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:27,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:27,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1120567233, now seen corresponding path program 2 times [2025-01-09 03:51:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095067506] [2025-01-09 03:51:27,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:51:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:27,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-01-09 03:51:27,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:51:27,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:51:27,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:51:27,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:27,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095067506] [2025-01-09 03:51:27,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095067506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:27,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:27,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:51:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084163017] [2025-01-09 03:51:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:27,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:27,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:27,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:27,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:51:27,842 INFO L87 Difference]: Start difference. First operand 414 states and 625 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:27,908 INFO L93 Difference]: Finished difference Result 803 states and 1215 transitions. [2025-01-09 03:51:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:27,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-01-09 03:51:27,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:27,915 INFO L225 Difference]: With dead ends: 803 [2025-01-09 03:51:27,916 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 03:51:27,917 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:51:27,918 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 2 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:27,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2079 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 03:51:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-01-09 03:51:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.509433962264151) internal successors, (480), 323 states have internal predecessors, (480), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (74), 69 states have call predecessors, (74), 69 states have call successors, (74) [2025-01-09 03:51:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 624 transitions. [2025-01-09 03:51:27,956 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 624 transitions. Word has length 110 [2025-01-09 03:51:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:27,956 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 624 transitions. [2025-01-09 03:51:27,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 624 transitions. [2025-01-09 03:51:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:51:27,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:27,959 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] [2025-01-09 03:51:27,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:51:27,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1290526038, now seen corresponding path program 3 times [2025-01-09 03:51:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298808898] [2025-01-09 03:51:27,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:51:27,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:27,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 3 equivalence classes. [2025-01-09 03:51:27,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 99 of 111 statements. [2025-01-09 03:51:27,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:51:27,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:51:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:28,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298808898] [2025-01-09 03:51:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298808898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:28,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:28,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:51:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932347412] [2025-01-09 03:51:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:28,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:28,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:28,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:51:28,102 INFO L87 Difference]: Start difference. First operand 414 states and 624 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:28,172 INFO L93 Difference]: Finished difference Result 805 states and 1221 transitions. [2025-01-09 03:51:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:28,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-01-09 03:51:28,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:28,176 INFO L225 Difference]: With dead ends: 805 [2025-01-09 03:51:28,177 INFO L226 Difference]: Without dead ends: 416 [2025-01-09 03:51:28,178 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:51:28,179 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2090 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:51:28,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2090 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-09 03:51:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-01-09 03:51:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 325 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (79), 69 states have call predecessors, (79), 69 states have call successors, (79) [2025-01-09 03:51:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 630 transitions. [2025-01-09 03:51:28,208 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 630 transitions. Word has length 111 [2025-01-09 03:51:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:28,208 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 630 transitions. [2025-01-09 03:51:28,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 630 transitions. [2025-01-09 03:51:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:51:28,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:28,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:28,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:51:28,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:28,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash 43428454, now seen corresponding path program 1 times [2025-01-09 03:51:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:28,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445974543] [2025-01-09 03:51:28,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:28,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:51:28,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:51:28,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:28,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:51:28,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:28,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445974543] [2025-01-09 03:51:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445974543] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:28,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:51:28,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525575771] [2025-01-09 03:51:28,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:28,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:51:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:28,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:51:28,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:51:28,373 INFO L87 Difference]: Start difference. First operand 416 states and 630 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:28,443 INFO L93 Difference]: Finished difference Result 811 states and 1231 transitions. [2025-01-09 03:51:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:51:28,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-01-09 03:51:28,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:28,447 INFO L225 Difference]: With dead ends: 811 [2025-01-09 03:51:28,447 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 03:51:28,448 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:51:28,449 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:28,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2096 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 03:51:28,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-01-09 03:51:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 320 states have (on average 1.50625) internal successors, (482), 327 states have internal predecessors, (482), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2025-01-09 03:51:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2025-01-09 03:51:28,468 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 112 [2025-01-09 03:51:28,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:28,468 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2025-01-09 03:51:28,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:51:28,469 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2025-01-09 03:51:28,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:51:28,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:28,471 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:51:28,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:51:28,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:28,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:28,472 INFO L85 PathProgramCache]: Analyzing trace with hash -59290155, now seen corresponding path program 1 times [2025-01-09 03:51:28,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:28,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064841921] [2025-01-09 03:51:28,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:28,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:51:28,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:51:28,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:28,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:28,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:28,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064841921] [2025-01-09 03:51:28,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064841921] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:51:28,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12400187] [2025-01-09 03:51:28,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:28,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:28,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:51:28,637 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:51:28,639 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:51:28,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:51:28,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:51:28,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:28,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:28,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:51:28,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:51:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:28,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:51:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:29,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12400187] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:51:29,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:51:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:51:29,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371044222] [2025-01-09 03:51:29,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:51:29,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:51:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:29,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:51:29,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:51:29,112 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:51:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:29,276 INFO L93 Difference]: Finished difference Result 973 states and 1525 transitions. [2025-01-09 03:51:29,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:51:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 113 [2025-01-09 03:51:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:29,284 INFO L225 Difference]: With dead ends: 973 [2025-01-09 03:51:29,284 INFO L226 Difference]: Without dead ends: 764 [2025-01-09 03:51:29,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:51:29,288 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 407 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:29,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1868 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:51:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-01-09 03:51:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 740. [2025-01-09 03:51:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 578 states have (on average 1.5813148788927336) internal successors, (914), 585 states have internal predecessors, (914), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2025-01-09 03:51:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1203 transitions. [2025-01-09 03:51:29,334 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1203 transitions. Word has length 113 [2025-01-09 03:51:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:29,336 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1203 transitions. [2025-01-09 03:51:29,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:51:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1203 transitions. [2025-01-09 03:51:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:51:29,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:29,341 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:51:29,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:51:29,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:29,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash -21638876, now seen corresponding path program 1 times [2025-01-09 03:51:29,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:29,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232978642] [2025-01-09 03:51:29,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:29,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:51:29,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:51:29,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:29,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:29,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:29,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232978642] [2025-01-09 03:51:29,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232978642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:29,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:29,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:29,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560954825] [2025-01-09 03:51:29,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:29,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:29,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:29,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:29,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:29,646 INFO L87 Difference]: Start difference. First operand 740 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:29,698 INFO L93 Difference]: Finished difference Result 1740 states and 2873 transitions. [2025-01-09 03:51:29,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:29,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-01-09 03:51:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:29,710 INFO L225 Difference]: With dead ends: 1740 [2025-01-09 03:51:29,710 INFO L226 Difference]: Without dead ends: 1066 [2025-01-09 03:51:29,714 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:51:29,715 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 105 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1078 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:51:29,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1078 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:29,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-01-09 03:51:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1058. [2025-01-09 03:51:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 832 states have (on average 1.6009615384615385) internal successors, (1332), 839 states have internal predecessors, (1332), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2025-01-09 03:51:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1759 transitions. [2025-01-09 03:51:29,774 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1759 transitions. Word has length 120 [2025-01-09 03:51:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:29,775 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1759 transitions. [2025-01-09 03:51:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1759 transitions. [2025-01-09 03:51:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:51:29,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:29,782 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:29,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:51:29,782 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:29,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash -222421843, now seen corresponding path program 1 times [2025-01-09 03:51:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:29,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999382380] [2025-01-09 03:51:29,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:29,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:29,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:51:29,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:51:29,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:29,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:29,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999382380] [2025-01-09 03:51:29,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999382380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:29,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:29,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810157427] [2025-01-09 03:51:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:29,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:29,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:29,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:29,850 INFO L87 Difference]: Start difference. First operand 1058 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:29,907 INFO L93 Difference]: Finished difference Result 2503 states and 4189 transitions. [2025-01-09 03:51:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:29,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-01-09 03:51:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:29,921 INFO L225 Difference]: With dead ends: 2503 [2025-01-09 03:51:29,921 INFO L226 Difference]: Without dead ends: 1562 [2025-01-09 03:51:29,926 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:51:29,927 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 103 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1070 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:51:29,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1070 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:29,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-01-09 03:51:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1554. [2025-01-09 03:51:30,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1233 states have (on average 1.6147607461476075) internal successors, (1991), 1240 states have internal predecessors, (1991), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2025-01-09 03:51:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2608 transitions. [2025-01-09 03:51:30,038 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2608 transitions. Word has length 121 [2025-01-09 03:51:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:30,038 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2608 transitions. [2025-01-09 03:51:30,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2608 transitions. [2025-01-09 03:51:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:51:30,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:30,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:30,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:51:30,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:30,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash 652930854, now seen corresponding path program 1 times [2025-01-09 03:51:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813762986] [2025-01-09 03:51:30,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:30,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:51:30,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:51:30,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:30,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813762986] [2025-01-09 03:51:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813762986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:30,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:30,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:30,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302589122] [2025-01-09 03:51:30,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:30,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:30,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:30,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:30,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:30,126 INFO L87 Difference]: Start difference. First operand 1554 states and 2608 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:30,211 INFO L93 Difference]: Finished difference Result 3627 states and 6136 transitions. [2025-01-09 03:51:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-01-09 03:51:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:30,229 INFO L225 Difference]: With dead ends: 3627 [2025-01-09 03:51:30,230 INFO L226 Difference]: Without dead ends: 2311 [2025-01-09 03:51:30,237 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:51:30,237 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 101 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:30,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2025-01-09 03:51:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2303. [2025-01-09 03:51:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1859 states have (on average 1.6256051640667026) internal successors, (3022), 1866 states have internal predecessors, (3022), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2025-01-09 03:51:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 3901 transitions. [2025-01-09 03:51:30,414 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 3901 transitions. Word has length 122 [2025-01-09 03:51:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:30,414 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 3901 transitions. [2025-01-09 03:51:30,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 3901 transitions. [2025-01-09 03:51:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:51:30,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:30,427 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:30,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:51:30,427 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash -407433746, now seen corresponding path program 1 times [2025-01-09 03:51:30,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:30,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337608814] [2025-01-09 03:51:30,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:30,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:30,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:51:30,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:51:30,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:30,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:30,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:30,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337608814] [2025-01-09 03:51:30,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337608814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:30,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:30,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:30,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304944642] [2025-01-09 03:51:30,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:30,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:30,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:30,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:30,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:30,500 INFO L87 Difference]: Start difference. First operand 2303 states and 3901 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:30,609 INFO L93 Difference]: Finished difference Result 5375 states and 9167 transitions. [2025-01-09 03:51:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:30,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-01-09 03:51:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:30,634 INFO L225 Difference]: With dead ends: 5375 [2025-01-09 03:51:30,634 INFO L226 Difference]: Without dead ends: 3507 [2025-01-09 03:51:30,643 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:51:30,643 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 99 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:30,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2025-01-09 03:51:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 3499. [2025-01-09 03:51:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3499 states, 2876 states have (on average 1.6328233657858136) internal successors, (4696), 2883 states have internal predecessors, (4696), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2025-01-09 03:51:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 3499 states and 5959 transitions. [2025-01-09 03:51:30,882 INFO L78 Accepts]: Start accepts. Automaton has 3499 states and 5959 transitions. Word has length 123 [2025-01-09 03:51:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:30,882 INFO L471 AbstractCegarLoop]: Abstraction has 3499 states and 5959 transitions. [2025-01-09 03:51:30,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3499 states and 5959 transitions. [2025-01-09 03:51:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:51:30,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:30,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:30,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:51:30,900 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:30,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:30,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1272875454, now seen corresponding path program 1 times [2025-01-09 03:51:30,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:30,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236249243] [2025-01-09 03:51:30,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:30,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:30,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:51:30,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:51:30,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:30,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:30,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236249243] [2025-01-09 03:51:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236249243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777251822] [2025-01-09 03:51:30,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:30,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:30,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:30,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:30,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:30,975 INFO L87 Difference]: Start difference. First operand 3499 states and 5959 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:31,204 INFO L93 Difference]: Finished difference Result 8246 states and 14137 transitions. [2025-01-09 03:51:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:31,205 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-01-09 03:51:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:31,246 INFO L225 Difference]: With dead ends: 8246 [2025-01-09 03:51:31,246 INFO L226 Difference]: Without dead ends: 5483 [2025-01-09 03:51:31,260 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:51:31,261 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 97 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:31,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1059 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-01-09 03:51:31,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5475. [2025-01-09 03:51:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5475 states, 4476 states have (on average 1.6293565683646112) internal successors, (7293), 4483 states have internal predecessors, (7293), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2025-01-09 03:51:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5475 states to 5475 states and 9352 transitions. [2025-01-09 03:51:31,689 INFO L78 Accepts]: Start accepts. Automaton has 5475 states and 9352 transitions. Word has length 124 [2025-01-09 03:51:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:31,690 INFO L471 AbstractCegarLoop]: Abstraction has 5475 states and 9352 transitions. [2025-01-09 03:51:31,690 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5475 states and 9352 transitions. [2025-01-09 03:51:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:51:31,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:31,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:51:31,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:31,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1333081810, now seen corresponding path program 1 times [2025-01-09 03:51:31,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:31,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151910702] [2025-01-09 03:51:31,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:31,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:31,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:51:31,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:51:31,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:31,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:31,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:31,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151910702] [2025-01-09 03:51:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151910702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:31,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:31,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:31,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038159930] [2025-01-09 03:51:31,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:31,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:31,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:31,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:31,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:31,839 INFO L87 Difference]: Start difference. First operand 5475 states and 9352 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:32,134 INFO L93 Difference]: Finished difference Result 13450 states and 23114 transitions. [2025-01-09 03:51:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:32,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-01-09 03:51:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:32,217 INFO L225 Difference]: With dead ends: 13450 [2025-01-09 03:51:32,217 INFO L226 Difference]: Without dead ends: 9072 [2025-01-09 03:51:32,243 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:51:32,244 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 95 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1060 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:51:32,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1060 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9072 states. [2025-01-09 03:51:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9072 to 9064. [2025-01-09 03:51:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9064 states, 7459 states have (on average 1.6282343477677972) internal successors, (12145), 7466 states have internal predecessors, (12145), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2025-01-09 03:51:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9064 states to 9064 states and 15494 transitions. [2025-01-09 03:51:32,834 INFO L78 Accepts]: Start accepts. Automaton has 9064 states and 15494 transitions. Word has length 125 [2025-01-09 03:51:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:32,835 INFO L471 AbstractCegarLoop]: Abstraction has 9064 states and 15494 transitions. [2025-01-09 03:51:32,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9064 states and 15494 transitions. [2025-01-09 03:51:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:51:32,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:32,865 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:32,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:51:32,866 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:32,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash -580435056, now seen corresponding path program 1 times [2025-01-09 03:51:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:32,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705958906] [2025-01-09 03:51:32,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:32,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:32,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:51:32,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:51:32,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:32,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:32,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:32,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705958906] [2025-01-09 03:51:32,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705958906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:32,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:32,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791262641] [2025-01-09 03:51:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:32,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:32,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:32,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:32,980 INFO L87 Difference]: Start difference. First operand 9064 states and 15494 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:33,437 INFO L93 Difference]: Finished difference Result 23396 states and 40141 transitions. [2025-01-09 03:51:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:33,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-01-09 03:51:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:33,524 INFO L225 Difference]: With dead ends: 23396 [2025-01-09 03:51:33,524 INFO L226 Difference]: Without dead ends: 15859 [2025-01-09 03:51:33,560 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:51:33,561 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 93 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1069 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:51:33,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1069 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15859 states. [2025-01-09 03:51:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15859 to 15851. [2025-01-09 03:51:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15851 states, 13043 states have (on average 1.6193360423215517) internal successors, (21121), 13050 states have internal predecessors, (21121), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2025-01-09 03:51:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 27020 transitions. [2025-01-09 03:51:34,457 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 27020 transitions. Word has length 126 [2025-01-09 03:51:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:34,457 INFO L471 AbstractCegarLoop]: Abstraction has 15851 states and 27020 transitions. [2025-01-09 03:51:34,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 27020 transitions. [2025-01-09 03:51:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:51:34,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:34,501 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:34,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:51:34,501 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:34,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1664461107, now seen corresponding path program 1 times [2025-01-09 03:51:34,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:34,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843710629] [2025-01-09 03:51:34,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:34,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:51:34,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:51:34,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:34,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:34,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:34,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843710629] [2025-01-09 03:51:34,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843710629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:34,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:34,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:34,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36590207] [2025-01-09 03:51:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:34,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:34,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:34,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:34,578 INFO L87 Difference]: Start difference. First operand 15851 states and 27020 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:35,340 INFO L93 Difference]: Finished difference Result 41922 states and 71760 transitions. [2025-01-09 03:51:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:35,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-01-09 03:51:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:35,504 INFO L225 Difference]: With dead ends: 41922 [2025-01-09 03:51:35,504 INFO L226 Difference]: Without dead ends: 28211 [2025-01-09 03:51:35,571 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:51:35,573 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 91 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:35,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1058 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28211 states. [2025-01-09 03:51:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28211 to 28203. [2025-01-09 03:51:37,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28203 states, 23356 states have (on average 1.6150882000342524) internal successors, (37722), 23363 states have internal predecessors, (37722), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2025-01-09 03:51:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28203 states to 28203 states and 47973 transitions. [2025-01-09 03:51:37,164 INFO L78 Accepts]: Start accepts. Automaton has 28203 states and 47973 transitions. Word has length 127 [2025-01-09 03:51:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:37,165 INFO L471 AbstractCegarLoop]: Abstraction has 28203 states and 47973 transitions. [2025-01-09 03:51:37,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28203 states and 47973 transitions. [2025-01-09 03:51:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:51:37,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:37,218 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:37,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:51:37,218 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:37,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1079211602, now seen corresponding path program 1 times [2025-01-09 03:51:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:37,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903849920] [2025-01-09 03:51:37,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:37,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:37,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:51:37,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:51:37,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:37,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903849920] [2025-01-09 03:51:37,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903849920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:37,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:37,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860451526] [2025-01-09 03:51:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:37,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:37,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:37,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:37,311 INFO L87 Difference]: Start difference. First operand 28203 states and 47973 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:38,741 INFO L93 Difference]: Finished difference Result 76849 states and 131152 transitions. [2025-01-09 03:51:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:38,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-01-09 03:51:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:39,048 INFO L225 Difference]: With dead ends: 76849 [2025-01-09 03:51:39,048 INFO L226 Difference]: Without dead ends: 51521 [2025-01-09 03:51:39,151 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:51:39,152 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 89 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1069 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:51:39,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1069 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51521 states. [2025-01-09 03:51:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51521 to 51513. [2025-01-09 03:51:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51513 states, 42951 states have (on average 1.6093222509371143) internal successors, (69122), 42958 states have internal predecessors, (69122), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2025-01-09 03:51:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51513 states to 51513 states and 87335 transitions. [2025-01-09 03:51:41,961 INFO L78 Accepts]: Start accepts. Automaton has 51513 states and 87335 transitions. Word has length 128 [2025-01-09 03:51:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:41,962 INFO L471 AbstractCegarLoop]: Abstraction has 51513 states and 87335 transitions. [2025-01-09 03:51:41,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 51513 states and 87335 transitions. [2025-01-09 03:51:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:51:42,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:42,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:42,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:51:42,012 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:42,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1199618931, now seen corresponding path program 1 times [2025-01-09 03:51:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:42,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654982548] [2025-01-09 03:51:42,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:42,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:51:42,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:51:42,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:42,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654982548] [2025-01-09 03:51:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654982548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:42,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:42,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:51:42,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17721084] [2025-01-09 03:51:42,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:42,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:51:42,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:42,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:51:42,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:51:42,096 INFO L87 Difference]: Start difference. First operand 51513 states and 87335 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:44,199 INFO L93 Difference]: Finished difference Result 96101 states and 163251 transitions. [2025-01-09 03:51:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:51:44,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-01-09 03:51:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:44,716 INFO L225 Difference]: With dead ends: 96101 [2025-01-09 03:51:44,716 INFO L226 Difference]: Without dead ends: 95892 [2025-01-09 03:51:44,794 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:51:44,795 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 84 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:44,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1064 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:51:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95892 states. [2025-01-09 03:51:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95892 to 95884. [2025-01-09 03:51:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95884 states, 80523 states have (on average 1.6020764253691493) internal successors, (129004), 80530 states have internal predecessors, (129004), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2025-01-09 03:51:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95884 states to 95884 states and 161861 transitions. [2025-01-09 03:51:48,683 INFO L78 Accepts]: Start accepts. Automaton has 95884 states and 161861 transitions. Word has length 129 [2025-01-09 03:51:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:51:48,684 INFO L471 AbstractCegarLoop]: Abstraction has 95884 states and 161861 transitions. [2025-01-09 03:51:48,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:51:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 95884 states and 161861 transitions. [2025-01-09 03:51:49,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:51:49,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:51:49,190 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:49,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:51:49,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:51:49,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:51:49,191 INFO L85 PathProgramCache]: Analyzing trace with hash 911682417, now seen corresponding path program 1 times [2025-01-09 03:51:49,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:51:49,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749300022] [2025-01-09 03:51:49,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:51:49,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:51:49,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:51:49,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:51:49,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:51:49,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:51:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:51:49,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:51:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749300022] [2025-01-09 03:51:49,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749300022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:51:49,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:51:49,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 03:51:49,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405372366] [2025-01-09 03:51:49,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:51:49,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:51:49,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:51:49,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:51:49,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:51:49,614 INFO L87 Difference]: Start difference. First operand 95884 states and 161861 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-09 03:51:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:51:55,241 INFO L93 Difference]: Finished difference Result 191394 states and 328494 transitions. [2025-01-09 03:51:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 03:51:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 130 [2025-01-09 03:51:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:51:56,472 INFO L225 Difference]: With dead ends: 191394 [2025-01-09 03:51:56,472 INFO L226 Difference]: Without dead ends: 191191 [2025-01-09 03:51:56,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-01-09 03:51:56,576 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 1675 mSDsluCounter, 6584 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 7203 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:51:56,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 7203 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 03:51:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191191 states. [2025-01-09 03:52:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191191 to 191023. [2025-01-09 03:52:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191023 states, 160484 states have (on average 1.6027828319334014) internal successors, (257221), 160388 states have internal predecessors, (257221), 30469 states have call successors, (30469), 62 states have call predecessors, (30469), 69 states have return successors, (38125), 30578 states have call predecessors, (38125), 30466 states have call successors, (38125) [2025-01-09 03:52:04,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191023 states to 191023 states and 325815 transitions. [2025-01-09 03:52:04,838 INFO L78 Accepts]: Start accepts. Automaton has 191023 states and 325815 transitions. Word has length 130 [2025-01-09 03:52:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:04,839 INFO L471 AbstractCegarLoop]: Abstraction has 191023 states and 325815 transitions. [2025-01-09 03:52:04,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-01-09 03:52:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 191023 states and 325815 transitions. [2025-01-09 03:52:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:52:04,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:04,966 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:04,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:52:04,966 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:04,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1609558520, now seen corresponding path program 1 times [2025-01-09 03:52:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915906135] [2025-01-09 03:52:04,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:04,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:52:05,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:52:05,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:05,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:05,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915906135] [2025-01-09 03:52:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915906135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:05,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:05,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:52:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110577938] [2025-01-09 03:52:05,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:05,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:52:05,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:05,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:52:05,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:52:05,671 INFO L87 Difference]: Start difference. First operand 191023 states and 325815 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 8 states have internal predecessors, (90), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13)