./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product22.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_spec9_product22.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 0fc665e3899dd29ca5bf696fac98a46e2d1733c214ee43bc57c8fd7a101d2539 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:58:11,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:58:11,959 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:58:11,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:58:11,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:58:11,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:58:11,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:58:11,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:58:11,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:58:11,980 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:58:11,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:58:11,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:58:11,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:58:11,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:58:11,981 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:58:11,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:58:11,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:58:11,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:58:11,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:58:11,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:58:11,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:58:11,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:58:11,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:58:11,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:11,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:58:11,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:58:11,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:58:11,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:58:11,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:11,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:58:11,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:58:11,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:58:11,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:58:11,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:58:11,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:58:11,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:58:11,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:58:11,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:58:11,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:58:11,984 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 -> 0fc665e3899dd29ca5bf696fac98a46e2d1733c214ee43bc57c8fd7a101d2539 [2025-01-09 03:58:12,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:58:12,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:58:12,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:58:12,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:58:12,261 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:58:12,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product22.cil.c [2025-01-09 03:58:13,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac0e26db/68ffd7d54e4d4eb780d98ad9112ffaeb/FLAG97b77f03e [2025-01-09 03:58:13,947 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:58:13,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product22.cil.c [2025-01-09 03:58:13,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac0e26db/68ffd7d54e4d4eb780d98ad9112ffaeb/FLAG97b77f03e [2025-01-09 03:58:13,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ac0e26db/68ffd7d54e4d4eb780d98ad9112ffaeb [2025-01-09 03:58:13,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:58:13,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:58:13,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:58:13,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:58:13,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:58:13,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:13" (1/1) ... [2025-01-09 03:58:13,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dbadeb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:13, skipping insertion in model container [2025-01-09 03:58:13,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:13" (1/1) ... [2025-01-09 03:58:14,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:58:14,464 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_spec9_product22.cil.c[51984,51997] [2025-01-09 03:58:14,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:58:14,536 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:58:14,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-01-09 03:58:14,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [172] [2025-01-09 03:58:14,546 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1252] [2025-01-09 03:58:14,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1481] [2025-01-09 03:58:14,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1886] [2025-01-09 03:58:14,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2191] [2025-01-09 03:58:14,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2479] [2025-01-09 03:58:14,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2488] [2025-01-09 03:58:14,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2854] [2025-01-09 03:58:14,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2896] [2025-01-09 03:58:14,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2913] [2025-01-09 03:58:14,613 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_spec9_product22.cil.c[51984,51997] [2025-01-09 03:58:14,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:58:14,647 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:58:14,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14 WrapperNode [2025-01-09 03:58:14,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:58:14,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:58:14,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:58:14,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:58:14,654 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:58:14" (1/1) ... [2025-01-09 03:58:14,681 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:58:14" (1/1) ... [2025-01-09 03:58:14,748 INFO L138 Inliner]: procedures = 129, calls = 193, calls flagged for inlining = 60, calls inlined = 55, statements flattened = 1035 [2025-01-09 03:58:14,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:58:14,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:58:14,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:58:14,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:58:14,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,800 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:58:14,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:58:14,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:58:14,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:58:14,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:58:14,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (1/1) ... [2025-01-09 03:58:14,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:58:14,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:14,889 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:58:14,896 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:58:14,914 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:58:14,914 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:58:14,915 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:58:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:58:14,915 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:58:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:58:14,915 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:58:14,915 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:58:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:58:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:58:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:58:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:58:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:58:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:58:14,916 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:58:14,916 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:58:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:58:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:58:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:58:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:58:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:58:14,917 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:58:14,917 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:58:14,918 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:58:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:58:14,918 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:58:14,918 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:58:14,918 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:58:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:58:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:58:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:58:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:58:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:58:14,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:58:14,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:58:15,082 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:58:15,086 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:58:15,852 INFO L? ?]: Removed 439 outVars from TransFormulas that were not future-live. [2025-01-09 03:58:15,852 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:58:15,870 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:58:15,873 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:58:15,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:15 BoogieIcfgContainer [2025-01-09 03:58:15,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:58:15,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:58:15,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:58:15,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:58:15,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:58:13" (1/3) ... [2025-01-09 03:58:15,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae59c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:15, skipping insertion in model container [2025-01-09 03:58:15,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:14" (2/3) ... [2025-01-09 03:58:15,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae59c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:58:15, skipping insertion in model container [2025-01-09 03:58:15,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:58:15" (3/3) ... [2025-01-09 03:58:15,882 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_product22.cil.c [2025-01-09 03:58:15,892 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:58:15,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_product22.cil.c that has 19 procedures, 321 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:58:15,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:58:15,946 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;@41e5089f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:58:15,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:58:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 321 states, 251 states have (on average 1.5258964143426295) internal successors, (383), 255 states have internal predecessors, (383), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 03:58:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 03:58:15,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:15,960 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] [2025-01-09 03:58:15,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:15,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash 142075550, now seen corresponding path program 1 times [2025-01-09 03:58:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177374074] [2025-01-09 03:58:15,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:16,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:58:16,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:58:16,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:16,505 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:58:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:16,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177374074] [2025-01-09 03:58:16,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177374074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:16,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588179197] [2025-01-09 03:58:16,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:16,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:16,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:16,508 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:58:16,510 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:58:16,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:58:16,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:58:16,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:16,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:16,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:58:16,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:16,772 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:58:16,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588179197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:16,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:16,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:58:16,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024832362] [2025-01-09 03:58:16,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:16,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:58:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:16,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:58:16,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:16,800 INFO L87 Difference]: Start difference. First operand has 321 states, 251 states have (on average 1.5258964143426295) internal successors, (383), 255 states have internal predecessors, (383), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:16,852 INFO L93 Difference]: Finished difference Result 484 states and 714 transitions. [2025-01-09 03:58:16,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:58:16,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-01-09 03:58:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:16,870 INFO L225 Difference]: With dead ends: 484 [2025-01-09 03:58:16,870 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 03:58:16,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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:58:16,875 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:16,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 03:58:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-01-09 03:58:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 245 states have (on average 1.5224489795918368) internal successors, (373), 248 states have internal predecessors, (373), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 03:58:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2025-01-09 03:58:16,932 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 89 [2025-01-09 03:58:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:16,936 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2025-01-09 03:58:16,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2025-01-09 03:58:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 03:58:16,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:16,940 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] [2025-01-09 03:58:16,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:58:17,140 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:58:17,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1030673676, now seen corresponding path program 1 times [2025-01-09 03:58:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:17,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6507617] [2025-01-09 03:58:17,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:17,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:58:17,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:58:17,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:17,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:17,362 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:58:17,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:17,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6507617] [2025-01-09 03:58:17,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6507617] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469668683] [2025-01-09 03:58:17,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:17,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:17,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:17,366 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:58:17,367 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:58:17,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 03:58:17,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 03:58:17,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:17,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:17,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:58:17,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:17,662 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:58:17,662 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:17,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469668683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:17,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:17,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:58:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979054145] [2025-01-09 03:58:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:17,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:17,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:17,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:17,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:17,664 INFO L87 Difference]: Start difference. First operand 314 states and 472 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:17,694 INFO L93 Difference]: Finished difference Result 473 states and 695 transitions. [2025-01-09 03:58:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:17,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-01-09 03:58:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:17,697 INFO L225 Difference]: With dead ends: 473 [2025-01-09 03:58:17,697 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 03:58:17,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 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:58:17,698 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:17,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 938 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:17,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 03:58:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2025-01-09 03:58:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 246 states have (on average 1.5203252032520325) internal successors, (374), 249 states have internal predecessors, (374), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 03:58:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 473 transitions. [2025-01-09 03:58:17,716 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 473 transitions. Word has length 89 [2025-01-09 03:58:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:17,716 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 473 transitions. [2025-01-09 03:58:17,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 473 transitions. [2025-01-09 03:58:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:58:17,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:17,722 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] [2025-01-09 03:58:17,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:58:17,923 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:58:17,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:17,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:17,924 INFO L85 PathProgramCache]: Analyzing trace with hash 583261593, now seen corresponding path program 1 times [2025-01-09 03:58:17,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:17,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967709919] [2025-01-09 03:58:17,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:17,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:58:17,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:58:17,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:17,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:18,104 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:58:18,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:18,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967709919] [2025-01-09 03:58:18,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967709919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:18,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747875199] [2025-01-09 03:58:18,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:18,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:18,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:18,107 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:58:18,108 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:58:18,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:58:18,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:58:18,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:18,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:18,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:58:18,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:18,331 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:58:18,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747875199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:18,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:18,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:58:18,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003002987] [2025-01-09 03:58:18,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:18,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:18,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:18,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:18,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:58:18,332 INFO L87 Difference]: Start difference. First operand 315 states and 473 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:18,356 INFO L93 Difference]: Finished difference Result 665 states and 1013 transitions. [2025-01-09 03:58:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:18,357 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-01-09 03:58:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:18,359 INFO L225 Difference]: With dead ends: 665 [2025-01-09 03:58:18,359 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 03:58:18,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 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:58:18,361 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 115 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 914 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:58:18,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 914 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 03:58:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2025-01-09 03:58:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 288 states have (on average 1.5381944444444444) internal successors, (443), 291 states have internal predecessors, (443), 61 states have call successors, (61), 18 states have call predecessors, (61), 18 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 03:58:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 564 transitions. [2025-01-09 03:58:18,379 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 564 transitions. Word has length 97 [2025-01-09 03:58:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:18,379 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 564 transitions. [2025-01-09 03:58:18,379 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 564 transitions. [2025-01-09 03:58:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:58:18,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:18,381 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] [2025-01-09 03:58:18,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:58:18,581 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:58:18,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:18,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1125746190, now seen corresponding path program 1 times [2025-01-09 03:58:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613522182] [2025-01-09 03:58:18,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:18,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:58:18,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:58:18,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:18,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:18,781 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:58:18,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:18,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613522182] [2025-01-09 03:58:18,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613522182] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:18,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227377733] [2025-01-09 03:58:18,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:18,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:18,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:18,784 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:58:18,787 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:58:18,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:58:19,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:58:19,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:19,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:19,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:58:19,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:19,078 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:58:19,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227377733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:19,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:19,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:58:19,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400061995] [2025-01-09 03:58:19,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:19,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:19,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:19,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:58:19,083 INFO L87 Difference]: Start difference. First operand 368 states and 564 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:19,136 INFO L93 Difference]: Finished difference Result 727 states and 1118 transitions. [2025-01-09 03:58:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:19,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2025-01-09 03:58:19,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:19,139 INFO L225 Difference]: With dead ends: 727 [2025-01-09 03:58:19,139 INFO L226 Difference]: Without dead ends: 370 [2025-01-09 03:58:19,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 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:58:19,141 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 2 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1845 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:58:19,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1845 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-09 03:58:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-01-09 03:58:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 289 states have (on average 1.5363321799307958) internal successors, (444), 293 states have internal predecessors, (444), 61 states have call successors, (61), 18 states have call predecessors, (61), 19 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-01-09 03:58:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 567 transitions. [2025-01-09 03:58:19,155 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 567 transitions. Word has length 98 [2025-01-09 03:58:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:19,155 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 567 transitions. [2025-01-09 03:58:19,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 567 transitions. [2025-01-09 03:58:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:58:19,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:19,157 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] [2025-01-09 03:58:19,165 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:58:19,358 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:58:19,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1785706804, now seen corresponding path program 1 times [2025-01-09 03:58:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863157773] [2025-01-09 03:58:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:19,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:58:19,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:58:19,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:19,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:19,568 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:58:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863157773] [2025-01-09 03:58:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863157773] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107100305] [2025-01-09 03:58:19,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:19,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:19,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:19,571 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:58:19,573 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:58:19,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:58:19,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:58:19,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:19,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:19,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:58:19,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:19,820 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:58:19,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:58:19,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107100305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:19,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:58:19,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:58:19,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138463884] [2025-01-09 03:58:19,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:19,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:19,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:19,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:19,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:58:19,823 INFO L87 Difference]: Start difference. First operand 370 states and 567 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:19,908 INFO L93 Difference]: Finished difference Result 729 states and 1123 transitions. [2025-01-09 03:58:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:19,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2025-01-09 03:58:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:19,912 INFO L225 Difference]: With dead ends: 729 [2025-01-09 03:58:19,913 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 03:58:19,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 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:58:19,915 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1831 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:19,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1831 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:58:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 03:58:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-01-09 03:58:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 290 states have (on average 1.5344827586206897) internal successors, (445), 295 states have internal predecessors, (445), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-01-09 03:58:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 573 transitions. [2025-01-09 03:58:19,938 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 573 transitions. Word has length 99 [2025-01-09 03:58:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:19,940 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 573 transitions. [2025-01-09 03:58:19,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 573 transitions. [2025-01-09 03:58:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:58:19,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:19,943 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] [2025-01-09 03:58:19,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:58:20,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:20,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:20,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash 917765724, now seen corresponding path program 1 times [2025-01-09 03:58:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:20,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521952848] [2025-01-09 03:58:20,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:20,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:58:20,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:58:20,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:20,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:20,296 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:58:20,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:20,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521952848] [2025-01-09 03:58:20,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521952848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:20,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:20,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:20,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506816864] [2025-01-09 03:58:20,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:20,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:20,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:20,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:20,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:20,299 INFO L87 Difference]: Start difference. First operand 372 states and 573 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:20,343 INFO L93 Difference]: Finished difference Result 721 states and 1114 transitions. [2025-01-09 03:58:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:20,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2025-01-09 03:58:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:20,346 INFO L225 Difference]: With dead ends: 721 [2025-01-09 03:58:20,346 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 03:58:20,347 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:58:20,347 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 2 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1849 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:58:20,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1849 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:20,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 03:58:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-01-09 03:58:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 290 states have (on average 1.5344827586206897) internal successors, (445), 295 states have internal predecessors, (445), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-01-09 03:58:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 572 transitions. [2025-01-09 03:58:20,378 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 572 transitions. Word has length 100 [2025-01-09 03:58:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:20,378 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 572 transitions. [2025-01-09 03:58:20,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 572 transitions. [2025-01-09 03:58:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:58:20,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:20,385 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] [2025-01-09 03:58:20,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:58:20,385 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:20,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1216191900, now seen corresponding path program 2 times [2025-01-09 03:58:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054254247] [2025-01-09 03:58:20,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:58:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:20,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 101 statements into 2 equivalence classes. [2025-01-09 03:58:20,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:58:20,433 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:58:20,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:20,550 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:58:20,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:20,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054254247] [2025-01-09 03:58:20,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054254247] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:20,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:20,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489400645] [2025-01-09 03:58:20,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:20,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:20,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:20,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:20,552 INFO L87 Difference]: Start difference. First operand 372 states and 572 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:20,603 INFO L93 Difference]: Finished difference Result 719 states and 1109 transitions. [2025-01-09 03:58:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2025-01-09 03:58:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:20,607 INFO L225 Difference]: With dead ends: 719 [2025-01-09 03:58:20,607 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 03:58:20,608 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:58:20,608 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1835 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:58:20,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1835 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 03:58:20,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-01-09 03:58:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 290 states have (on average 1.5344827586206897) internal successors, (445), 295 states have internal predecessors, (445), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (65), 60 states have call predecessors, (65), 60 states have call successors, (65) [2025-01-09 03:58:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 571 transitions. [2025-01-09 03:58:20,622 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 571 transitions. Word has length 101 [2025-01-09 03:58:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:20,622 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 571 transitions. [2025-01-09 03:58:20,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 571 transitions. [2025-01-09 03:58:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:58:20,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:20,624 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] [2025-01-09 03:58:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:58:20,624 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash -196994898, now seen corresponding path program 3 times [2025-01-09 03:58:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890913228] [2025-01-09 03:58:20,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:58:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:20,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 102 statements into 3 equivalence classes. [2025-01-09 03:58:20,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 90 of 102 statements. [2025-01-09 03:58:20,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:58:20,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:20,739 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:58:20,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:20,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890913228] [2025-01-09 03:58:20,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890913228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:20,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:20,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010785441] [2025-01-09 03:58:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:20,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:20,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:20,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:20,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:20,741 INFO L87 Difference]: Start difference. First operand 372 states and 571 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:20,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:20,793 INFO L93 Difference]: Finished difference Result 721 states and 1115 transitions. [2025-01-09 03:58:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-01-09 03:58:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:20,797 INFO L225 Difference]: With dead ends: 721 [2025-01-09 03:58:20,797 INFO L226 Difference]: Without dead ends: 374 [2025-01-09 03:58:20,798 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:58:20,799 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1846 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:58:20,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1846 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-09 03:58:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-01-09 03:58:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 291 states have (on average 1.5326460481099657) internal successors, (446), 297 states have internal predecessors, (446), 61 states have call successors, (61), 18 states have call predecessors, (61), 21 states have return successors, (70), 60 states have call predecessors, (70), 60 states have call successors, (70) [2025-01-09 03:58:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 577 transitions. [2025-01-09 03:58:20,814 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 577 transitions. Word has length 102 [2025-01-09 03:58:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:20,815 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 577 transitions. [2025-01-09 03:58:20,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 577 transitions. [2025-01-09 03:58:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:58:20,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:20,817 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] [2025-01-09 03:58:20,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:58:20,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:20,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:20,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1837900927, now seen corresponding path program 1 times [2025-01-09 03:58:20,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:20,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988863522] [2025-01-09 03:58:20,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:20,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:58:20,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:58:20,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:20,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:20,935 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:58:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988863522] [2025-01-09 03:58:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988863522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:58:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883893913] [2025-01-09 03:58:20,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:58:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:20,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:58:20,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:58:20,937 INFO L87 Difference]: Start difference. First operand 374 states and 577 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:20,979 INFO L93 Difference]: Finished difference Result 727 states and 1125 transitions. [2025-01-09 03:58:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:58:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2025-01-09 03:58:20,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:20,983 INFO L225 Difference]: With dead ends: 727 [2025-01-09 03:58:20,983 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 03:58:20,984 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:58:20,985 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1852 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:58:20,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1852 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 03:58:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-01-09 03:58:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 292 states have (on average 1.5308219178082192) internal successors, (447), 299 states have internal predecessors, (447), 61 states have call successors, (61), 18 states have call predecessors, (61), 22 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-01-09 03:58:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 580 transitions. [2025-01-09 03:58:21,005 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 580 transitions. Word has length 103 [2025-01-09 03:58:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:21,005 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 580 transitions. [2025-01-09 03:58:21,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 03:58:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 580 transitions. [2025-01-09 03:58:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:58:21,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:21,007 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] [2025-01-09 03:58:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:58:21,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash -845360814, now seen corresponding path program 1 times [2025-01-09 03:58:21,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:21,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071608932] [2025-01-09 03:58:21,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:21,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:58:21,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:58:21,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:21,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:58:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071608932] [2025-01-09 03:58:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071608932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:58:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361694031] [2025-01-09 03:58:21,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:21,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:58:21,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:58:21,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:58:21,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:58:21,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 03:58:21,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 03:58:21,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:21,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:21,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:58:21,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:58:21,389 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:58:21,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:58:21,463 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:58:21,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361694031] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:58:21,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:58:21,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:58:21,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849525034] [2025-01-09 03:58:21,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:58:21,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:58:21,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:21,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:58:21,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:58:21,467 INFO L87 Difference]: Start difference. First operand 376 states and 580 transitions. Second operand has 11 states, 10 states have (on average 11.0) internal successors, (110), 11 states have internal predecessors, (110), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:58:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:21,978 INFO L93 Difference]: Finished difference Result 1097 states and 1765 transitions. [2025-01-09 03:58:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:58:21,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.0) internal successors, (110), 11 states have internal predecessors, (110), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 104 [2025-01-09 03:58:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:21,983 INFO L225 Difference]: With dead ends: 1097 [2025-01-09 03:58:21,983 INFO L226 Difference]: Without dead ends: 749 [2025-01-09 03:58:21,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:58:21,985 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1154 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:21,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 3322 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:58:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-01-09 03:58:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 725. [2025-01-09 03:58:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 577 states have (on average 1.584055459272097) internal successors, (914), 583 states have internal predecessors, (914), 125 states have call successors, (125), 19 states have call predecessors, (125), 22 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2025-01-09 03:58:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1185 transitions. [2025-01-09 03:58:22,016 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1185 transitions. Word has length 104 [2025-01-09 03:58:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:22,016 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1185 transitions. [2025-01-09 03:58:22,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.0) internal successors, (110), 11 states have internal predecessors, (110), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:58:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1185 transitions. [2025-01-09 03:58:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:58:22,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:22,020 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] [2025-01-09 03:58:22,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:58:22,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:58:22,221 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1102471957, now seen corresponding path program 1 times [2025-01-09 03:58:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854231289] [2025-01-09 03:58:22,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:22,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:58:22,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:58:22,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:22,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:22,304 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:58:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:22,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854231289] [2025-01-09 03:58:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854231289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:22,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:22,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847752786] [2025-01-09 03:58:22,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:22,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:22,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:22,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:22,306 INFO L87 Difference]: Start difference. First operand 725 states and 1185 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:22,346 INFO L93 Difference]: Finished difference Result 1698 states and 2821 transitions. [2025-01-09 03:58:22,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:22,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 03:58:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:22,354 INFO L225 Difference]: With dead ends: 1698 [2025-01-09 03:58:22,355 INFO L226 Difference]: Without dead ends: 1051 [2025-01-09 03:58:22,358 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:58:22,358 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 112 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 954 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:58:22,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 954 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-01-09 03:58:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2025-01-09 03:58:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 831 states have (on average 1.6028880866425992) internal successors, (1332), 837 states have internal predecessors, (1332), 189 states have call successors, (189), 19 states have call predecessors, (189), 22 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2025-01-09 03:58:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1741 transitions. [2025-01-09 03:58:22,416 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1741 transitions. Word has length 108 [2025-01-09 03:58:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:22,416 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1741 transitions. [2025-01-09 03:58:22,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1741 transitions. [2025-01-09 03:58:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:58:22,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:22,422 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:58:22,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:58:22,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:22,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash -693885615, now seen corresponding path program 1 times [2025-01-09 03:58:22,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:22,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403470819] [2025-01-09 03:58:22,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:22,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:22,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:58:22,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:58:22,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:22,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:22,482 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:58:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403470819] [2025-01-09 03:58:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403470819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419618579] [2025-01-09 03:58:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:22,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:22,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:22,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:22,484 INFO L87 Difference]: Start difference. First operand 1043 states and 1741 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:22,535 INFO L93 Difference]: Finished difference Result 2486 states and 4172 transitions. [2025-01-09 03:58:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:22,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-01-09 03:58:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:22,552 INFO L225 Difference]: With dead ends: 2486 [2025-01-09 03:58:22,555 INFO L226 Difference]: Without dead ends: 1572 [2025-01-09 03:58:22,564 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:58:22,565 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 110 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 944 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:58:22,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 944 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-01-09 03:58:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1564. [2025-01-09 03:58:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1257 states have (on average 1.6117740652346857) internal successors, (2026), 1263 states have internal predecessors, (2026), 284 states have call successors, (284), 19 states have call predecessors, (284), 22 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2025-01-09 03:58:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2625 transitions. [2025-01-09 03:58:22,698 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2625 transitions. Word has length 109 [2025-01-09 03:58:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:22,698 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2625 transitions. [2025-01-09 03:58:22,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:22,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2625 transitions. [2025-01-09 03:58:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:58:22,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:22,705 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] [2025-01-09 03:58:22,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:58:22,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:22,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1098411271, now seen corresponding path program 1 times [2025-01-09 03:58:22,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552117771] [2025-01-09 03:58:22,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:22,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:58:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:58:22,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:22,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:22,825 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:58:22,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552117771] [2025-01-09 03:58:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552117771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:22,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:22,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138055106] [2025-01-09 03:58:22,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:22,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:22,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:22,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:22,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:22,826 INFO L87 Difference]: Start difference. First operand 1564 states and 2625 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:22,919 INFO L93 Difference]: Finished difference Result 3665 states and 6196 transitions. [2025-01-09 03:58:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:22,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-01-09 03:58:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:22,933 INFO L225 Difference]: With dead ends: 3665 [2025-01-09 03:58:22,933 INFO L226 Difference]: Without dead ends: 2361 [2025-01-09 03:58:22,939 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:58:22,940 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 108 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 931 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:58:22,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:22,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-01-09 03:58:23,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2353. [2025-01-09 03:58:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 1923 states have (on average 1.6188247529901196) internal successors, (3113), 1929 states have internal predecessors, (3113), 407 states have call successors, (407), 19 states have call predecessors, (407), 22 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2025-01-09 03:58:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3974 transitions. [2025-01-09 03:58:23,072 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3974 transitions. Word has length 110 [2025-01-09 03:58:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:23,072 INFO L471 AbstractCegarLoop]: Abstraction has 2353 states and 3974 transitions. [2025-01-09 03:58:23,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3974 transitions. [2025-01-09 03:58:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:58:23,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:23,080 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] [2025-01-09 03:58:23,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:58:23,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1463687694, now seen corresponding path program 1 times [2025-01-09 03:58:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444808906] [2025-01-09 03:58:23,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:23,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:58:23,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:58:23,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:23,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:23,148 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:58:23,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444808906] [2025-01-09 03:58:23,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444808906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:23,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:23,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:23,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808669298] [2025-01-09 03:58:23,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:23,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:23,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:23,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:23,152 INFO L87 Difference]: Start difference. First operand 2353 states and 3974 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:23,250 INFO L93 Difference]: Finished difference Result 5503 states and 9353 transitions. [2025-01-09 03:58:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-01-09 03:58:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:23,271 INFO L225 Difference]: With dead ends: 5503 [2025-01-09 03:58:23,272 INFO L226 Difference]: Without dead ends: 3622 [2025-01-09 03:58:23,279 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:58:23,281 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 106 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 931 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:58:23,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2025-01-09 03:58:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3614. [2025-01-09 03:58:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3005 states have (on average 1.6232945091514144) internal successors, (4878), 3011 states have internal predecessors, (4878), 586 states have call successors, (586), 19 states have call predecessors, (586), 22 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2025-01-09 03:58:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 6123 transitions. [2025-01-09 03:58:23,479 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 6123 transitions. Word has length 111 [2025-01-09 03:58:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:23,479 INFO L471 AbstractCegarLoop]: Abstraction has 3614 states and 6123 transitions. [2025-01-09 03:58:23,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 6123 transitions. [2025-01-09 03:58:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:58:23,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:23,488 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] [2025-01-09 03:58:23,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:58:23,489 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash -966530507, now seen corresponding path program 1 times [2025-01-09 03:58:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:23,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520096126] [2025-01-09 03:58:23,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:23,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:58:23,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:58:23,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:23,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:23,540 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:58:23,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:23,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520096126] [2025-01-09 03:58:23,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520096126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:23,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:23,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:23,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704322121] [2025-01-09 03:58:23,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:23,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:23,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:23,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:23,542 INFO L87 Difference]: Start difference. First operand 3614 states and 6123 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:23,686 INFO L93 Difference]: Finished difference Result 8529 states and 14540 transitions. [2025-01-09 03:58:23,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:23,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-01-09 03:58:23,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:23,719 INFO L225 Difference]: With dead ends: 8529 [2025-01-09 03:58:23,719 INFO L226 Difference]: Without dead ends: 5708 [2025-01-09 03:58:23,731 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:58:23,732 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 104 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 944 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:58:23,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 944 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:23,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5708 states. [2025-01-09 03:58:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5708 to 5700. [2025-01-09 03:58:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5700 states, 4715 states have (on average 1.6180275715800636) internal successors, (7629), 4721 states have internal predecessors, (7629), 962 states have call successors, (962), 19 states have call predecessors, (962), 22 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2025-01-09 03:58:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 9670 transitions. [2025-01-09 03:58:24,055 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 9670 transitions. Word has length 112 [2025-01-09 03:58:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:24,055 INFO L471 AbstractCegarLoop]: Abstraction has 5700 states and 9670 transitions. [2025-01-09 03:58:24,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 9670 transitions. [2025-01-09 03:58:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:58:24,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:24,068 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:58:24,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:58:24,068 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:24,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1937571146, now seen corresponding path program 1 times [2025-01-09 03:58:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569033596] [2025-01-09 03:58:24,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:24,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:58:24,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:58:24,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:24,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:24,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:58:24,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:24,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569033596] [2025-01-09 03:58:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569033596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:24,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:24,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:24,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631383834] [2025-01-09 03:58:24,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:24,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:24,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:24,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:24,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:24,126 INFO L87 Difference]: Start difference. First operand 5700 states and 9670 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:24,362 INFO L93 Difference]: Finished difference Result 14013 states and 23909 transitions. [2025-01-09 03:58:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:24,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-01-09 03:58:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:24,432 INFO L225 Difference]: With dead ends: 14013 [2025-01-09 03:58:24,432 INFO L226 Difference]: Without dead ends: 9492 [2025-01-09 03:58:24,453 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:58:24,453 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 102 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 942 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:58:24,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 942 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:24,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9492 states. [2025-01-09 03:58:24,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9492 to 9484. [2025-01-09 03:58:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9484 states, 7893 states have (on average 1.6158621563410618) internal successors, (12754), 7899 states have internal predecessors, (12754), 1568 states have call successors, (1568), 19 states have call predecessors, (1568), 22 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2025-01-09 03:58:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9484 states to 9484 states and 16085 transitions. [2025-01-09 03:58:24,900 INFO L78 Accepts]: Start accepts. Automaton has 9484 states and 16085 transitions. Word has length 113 [2025-01-09 03:58:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:24,900 INFO L471 AbstractCegarLoop]: Abstraction has 9484 states and 16085 transitions. [2025-01-09 03:58:24,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 9484 states and 16085 transitions. [2025-01-09 03:58:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:58:24,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:24,914 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] [2025-01-09 03:58:24,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:58:24,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:24,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1849115997, now seen corresponding path program 1 times [2025-01-09 03:58:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:24,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404026234] [2025-01-09 03:58:24,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:24,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:58:24,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:58:24,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:24,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:25,023 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:58:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:25,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404026234] [2025-01-09 03:58:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404026234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:25,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630337778] [2025-01-09 03:58:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:25,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:25,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:25,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:25,025 INFO L87 Difference]: Start difference. First operand 9484 states and 16085 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:25,492 INFO L93 Difference]: Finished difference Result 24484 states and 41671 transitions. [2025-01-09 03:58:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2025-01-09 03:58:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:25,557 INFO L225 Difference]: With dead ends: 24484 [2025-01-09 03:58:25,557 INFO L226 Difference]: Without dead ends: 16639 [2025-01-09 03:58:25,593 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:58:25,593 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 100 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 959 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:58:25,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16639 states. [2025-01-09 03:58:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16639 to 16631. [2025-01-09 03:58:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16631 states, 13837 states have (on average 1.606851196068512) internal successors, (22234), 13843 states have internal predecessors, (22234), 2771 states have call successors, (2771), 19 states have call predecessors, (2771), 22 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2025-01-09 03:58:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16631 states to 16631 states and 28115 transitions. [2025-01-09 03:58:26,297 INFO L78 Accepts]: Start accepts. Automaton has 16631 states and 28115 transitions. Word has length 114 [2025-01-09 03:58:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:26,297 INFO L471 AbstractCegarLoop]: Abstraction has 16631 states and 28115 transitions. [2025-01-09 03:58:26,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 16631 states and 28115 transitions. [2025-01-09 03:58:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:58:26,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:26,318 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] [2025-01-09 03:58:26,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:58:26,319 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:26,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:26,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1187314569, now seen corresponding path program 1 times [2025-01-09 03:58:26,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:26,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050281314] [2025-01-09 03:58:26,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:26,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:26,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:58:26,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:58:26,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:26,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:26,366 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:58:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050281314] [2025-01-09 03:58:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050281314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:26,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:26,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:26,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623993689] [2025-01-09 03:58:26,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:26,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:26,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:26,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:26,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:26,368 INFO L87 Difference]: Start difference. First operand 16631 states and 28115 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:27,032 INFO L93 Difference]: Finished difference Result 44020 states and 74704 transitions. [2025-01-09 03:58:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:27,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-01-09 03:58:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:27,128 INFO L225 Difference]: With dead ends: 44020 [2025-01-09 03:58:27,128 INFO L226 Difference]: Without dead ends: 29676 [2025-01-09 03:58:27,161 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:58:27,161 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 98 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 934 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:58:27,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29676 states. [2025-01-09 03:58:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29676 to 29668. [2025-01-09 03:58:28,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29668 states, 24835 states have (on average 1.602335413730622) internal successors, (39794), 24841 states have internal predecessors, (39794), 4810 states have call successors, (4810), 19 states have call predecessors, (4810), 22 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-01-09 03:58:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29668 states to 29668 states and 50027 transitions. [2025-01-09 03:58:28,356 INFO L78 Accepts]: Start accepts. Automaton has 29668 states and 50027 transitions. Word has length 115 [2025-01-09 03:58:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:28,357 INFO L471 AbstractCegarLoop]: Abstraction has 29668 states and 50027 transitions. [2025-01-09 03:58:28,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 29668 states and 50027 transitions. [2025-01-09 03:58:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:58:28,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:28,378 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] [2025-01-09 03:58:28,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:58:28,379 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1556248197, now seen corresponding path program 1 times [2025-01-09 03:58:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357058041] [2025-01-09 03:58:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:28,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:28,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:58:28,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:58:28,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:28,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:28,433 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:58:28,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:28,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357058041] [2025-01-09 03:58:28,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357058041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:28,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:28,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:28,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670734247] [2025-01-09 03:58:28,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:28,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:28,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:28,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:28,435 INFO L87 Difference]: Start difference. First operand 29668 states and 50027 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:29,611 INFO L93 Difference]: Finished difference Result 80922 states and 136861 transitions. [2025-01-09 03:58:29,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:29,612 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2025-01-09 03:58:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:29,839 INFO L225 Difference]: With dead ends: 80922 [2025-01-09 03:58:29,840 INFO L226 Difference]: Without dead ends: 54316 [2025-01-09 03:58:29,908 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:58:29,908 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 96 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 934 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:58:29,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54316 states. [2025-01-09 03:58:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54316 to 54308. [2025-01-09 03:58:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54308 states, 45760 states have (on average 1.5965034965034965) internal successors, (73056), 45766 states have internal predecessors, (73056), 8525 states have call successors, (8525), 19 states have call predecessors, (8525), 22 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2025-01-09 03:58:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54308 states to 54308 states and 91251 transitions. [2025-01-09 03:58:32,154 INFO L78 Accepts]: Start accepts. Automaton has 54308 states and 91251 transitions. Word has length 116 [2025-01-09 03:58:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:32,154 INFO L471 AbstractCegarLoop]: Abstraction has 54308 states and 91251 transitions. [2025-01-09 03:58:32,154 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 54308 states and 91251 transitions. [2025-01-09 03:58:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:58:32,178 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:32,178 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] [2025-01-09 03:58:32,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:58:32,179 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:32,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1504003223, now seen corresponding path program 1 times [2025-01-09 03:58:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051923626] [2025-01-09 03:58:32,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:32,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:58:32,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:58:32,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:32,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:32,240 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:58:32,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:32,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051923626] [2025-01-09 03:58:32,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051923626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:32,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:32,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:58:32,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342420640] [2025-01-09 03:58:32,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:32,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:58:32,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:32,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:58:32,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:58:32,241 INFO L87 Difference]: Start difference. First operand 54308 states and 91251 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:34,116 INFO L93 Difference]: Finished difference Result 101459 states and 170759 transitions. [2025-01-09 03:58:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:58:34,116 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-01-09 03:58:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:34,454 INFO L225 Difference]: With dead ends: 101459 [2025-01-09 03:58:34,454 INFO L226 Difference]: Without dead ends: 101302 [2025-01-09 03:58:34,498 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:58:34,500 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 91 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 948 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:58:34,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 948 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:58:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101302 states. [2025-01-09 03:58:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101302 to 101294. [2025-01-09 03:58:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101294 states, 85947 states have (on average 1.5893399420573144) internal successors, (136599), 85953 states have internal predecessors, (136599), 15324 states have call successors, (15324), 19 states have call predecessors, (15324), 22 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2025-01-09 03:58:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101294 states to 101294 states and 169438 transitions. [2025-01-09 03:58:38,182 INFO L78 Accepts]: Start accepts. Automaton has 101294 states and 169438 transitions. Word has length 117 [2025-01-09 03:58:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:58:38,182 INFO L471 AbstractCegarLoop]: Abstraction has 101294 states and 169438 transitions. [2025-01-09 03:58:38,182 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, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 03:58:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 101294 states and 169438 transitions. [2025-01-09 03:58:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:58:38,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:58:38,202 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] [2025-01-09 03:58:38,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:58:38,203 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:58:38,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:58:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2126614596, now seen corresponding path program 1 times [2025-01-09 03:58:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:58:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455589204] [2025-01-09 03:58:38,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:58:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:58:38,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:58:38,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:58:38,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:58:38,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:58:38,459 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:58:38,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:58:38,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455589204] [2025-01-09 03:58:38,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455589204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:58:38,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:58:38,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:58:38,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887594577] [2025-01-09 03:58:38,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:58:38,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:58:38,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:58:38,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:58:38,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:58:38,461 INFO L87 Difference]: Start difference. First operand 101294 states and 169438 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-09 03:58:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:58:43,739 INFO L93 Difference]: Finished difference Result 201894 states and 343201 transitions. [2025-01-09 03:58:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 03:58:43,740 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 118 [2025-01-09 03:58:43,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:58:44,734 INFO L225 Difference]: With dead ends: 201894 [2025-01-09 03:58:44,734 INFO L226 Difference]: Without dead ends: 201743 [2025-01-09 03:58:44,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-01-09 03:58:44,831 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1223 mSDsluCounter, 4905 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:58:44,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 5494 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 03:58:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201743 states.